( en | de | ru )

 

Disambiguation of "Farber, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Edge-disjoint spanning trees: A connectedness theorem.

, , and . J. Graph Theory, 9 (3): 319-324 (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Martin Färber

Eduard Färber

Maria Färber

Christian Färber

Walter Farber

 

Other publications of authors with the same name

Edge-disjoint spanning trees: A connectedness theorem., , and . J. Graph Theory, 9 (3): 319-324 (1985)Independent domination in chordal graphs.. Oper. Res. Lett., 1 (4): 134-138 (1982)Domination in Permutation Graphs., and . J. Algorithms, 6 (3): 309-321 (1985)Absolute Reflexive Retracts and Absolute Bipartite Retracts., , and . Discret. Appl. Math., 44 (1-3): 9-20 (1993)On diameters and radii of bridged graphs.. Discret. Math., 73 (3): 249-260 (1989)On bridged graphs and cop-win graphs., and . J. Comb. Theory, Ser. B, 44 (1): 22-28 (1988)Steiner trees, connected domination and strongly chordal graphs., , and . Networks, 15 (1): 109-124 (1985)Characterizations of Totally Balanced Matrices., and . J. Algorithms, 5 (2): 215-230 (1984)Algorithmic Aspects of Neighborhood Numbers., , and . SIAM J. Discret. Math., 6 (1): 24-29 (1993)Characterizations of strongly chordal graphs.. Discret. Math., 43 (2-3): 173-189 (1983)