Martin Farber

16 papers Journal 16
YearRankTypeTitle / Venue / Authors
1993 J jnl
Absolute Reflexive Retracts and Absolute Bipartite Retracts.
Discret. Appl. Math.
Hans-Jürgen Bandelt, Martin Farber, Pavol Hell
1993 J jnl
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discret. Math.
Gerard J. Chang, Martin Farber, Zsolt Tuza
1993 J jnl
An upper bound on the number of cliques in a graph.
Networks
Martin Farber, Mihály Hujter, Zsolt Tuza
1989 J jnl
Basis pair graphs of transversal matroids are connected.
Discret. Math.
Martin Farber
1989 J jnl
On diameters and radii of bridged graphs.
Discret. Math.
Martin Farber
1988 J jnl
On bridged graphs and cop-win graphs.
J. Comb. Theory B
Richard P. Anstee, Martin Farber
1987 J jnl
Bridged graphs and geodesic convexity.
Discret. Math.
Martin Farber
1987 J jnl
On local convexity in graphs.
Discret. Math.
Martin Farber, Robert E. Jamison
1986 J jnl
Concerning the achromatic number of graphs.
J. Comb. Theory B
Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller
1985 J jnl
Domination in Permutation Graphs.
J. Algorithms
Martin Farber, J. Mark Keil
1985 J jnl
Edge-disjoint spanning trees: A connectedness theorem.
J. Graph Theory
Martin Farber, B. Richter, H. Shank
1985 J jnl
Steiner trees, connected domination and strongly chordal graphs.
Networks
Kevin White, Martin Farber, William R. Pulleyblank
1984 J jnl
Characterizations of Totally Balanced Matrices.
J. Algorithms
Richard P. Anstee, Martin Farber
1984 J jnl
Domination, independent domination, and duality in strongly chordal graphs.
Discret. Appl. Math.
Martin Farber
1983 J jnl
Characterizations of strongly chordal graphs.
Discret. Math.
Martin Farber
1982 J jnl
Independent domination in chordal graphs.
Oper. Res. Lett.
Martin Farber