Martin Farber

According to our database, Martin Farber authored at least 16 papers between 1982 and 1993.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1993

Algorithmic Aspects of Neighborhood Numbers.

Gerard J. Chang, Martin Farber, Zsolt Tuza

SIAM J. Discret. Math., 1993

An upper bound on the number of cliques in a graph.

Martin Farber, Mihály Hujter, Zsolt Tuza

Networks, 1993

Absolute Reflexive Retracts and Absolute Bipartite Retracts.

Hans-Jürgen Bandelt, Martin Farber, Pavol Hell

Discret. Appl. Math., 1993

1989

On diameters and radii of bridged graphs.

Martin Farber

Discret. Math., 1989

Basis pair graphs of transversal matroids are connected.

Martin Farber

Discret. Math., 1989

1988

On bridged graphs and cop-win graphs.

Richard P. Anstee, Martin Farber

J. Comb. Theory, Ser. B, 1988

1987

On local convexity in graphs.

Martin Farber, Robert E. Jamison

Discret. Math., 1987

Bridged graphs and geodesic convexity.

Martin Farber

Discret. Math., 1987

1986

Concerning the achromatic number of graphs.

Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller

J. Comb. Theory, Ser. B, 1986

1985

Steiner trees, connected domination and strongly chordal graphs.

Kevin White, Martin Farber, William R. Pulleyblank

Networks, 1985

Edge-disjoint spanning trees: A connectedness theorem.

Martin Farber, B. Richter, H. Shank

J. Graph Theory, 1985

Domination in Permutation Graphs.

Martin Farber, J. Mark Keil

J. Algorithms, 1985

1984

Characterizations of Totally Balanced Matrices.

Richard P. Anstee, Martin Farber

J. Algorithms, 1984

Domination, independent domination, and duality in strongly chordal graphs.

Martin Farber

Discret. Appl. Math., 1984

1983

Characterizations of strongly chordal graphs.

Martin Farber

Discret. Math., 1983

1982

Independent domination in chordal graphs.

Martin Farber

Oper. Res. Lett., 1982