Martin Farber

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1993
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discret. Math., 1993

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

Absolute Reflexive Retracts and Absolute Bipartite Retracts.
Discret. Appl. Math., 1993

1989
On diameters and radii of bridged graphs.
Discret. Math., 1989

Basis pair graphs of transversal matroids are connected.
Discret. Math., 1989

1988
On bridged graphs and cop-win graphs.
J. Comb. Theory B, 1988

1987
On local convexity in graphs.
Discret. Math., 1987

Bridged graphs and geodesic convexity.
Discret. Math., 1987

1986
Concerning the achromatic number of graphs.
J. Comb. Theory B, 1986

1985
Steiner trees, connected domination and strongly chordal graphs.
Networks, 1985

Edge-disjoint spanning trees: A connectedness theorem.
J. Graph Theory, 1985

Domination in Permutation Graphs.
J. Algorithms, 1985

1984
Characterizations of Totally Balanced Matrices.
J. Algorithms, 1984

Domination, independent domination, and duality in strongly chordal graphs.
Discret. Appl. Math., 1984

1983
Characterizations of strongly chordal graphs.
Discret. Math., 1983

1982
Independent domination in chordal graphs.
Oper. Res. Lett., 1982


  Loading...