Martin Farber - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

1993

Absolute Reflexive Retracts and Absolute Bipartite RetractsHans-Jürgen Bandelt, Martin Farber, Pavol Hell. DAM, 44(1-3):9-20, 1993. [doi]

Algorithmic Aspects of Neighborhood NumbersGerhard J. Chang, Martin Farber, Zsolt Tuza. siamdm, 6(1):24-29, 1993.

An upper bound on the number of cliques in a graphMartin Farber, Mihály Hujter, Zsolt Tuza. networks, 23(3):207-210, 1993. [doi]

1989

On diameters and radii of bridged graphsMartin Farber. DM, 73(3):249-260, 1989. [doi]

Basis pair graphs of transversal matroids are connectedMartin Farber. DM, 73(3):245-248, 1989. [doi]

1988

On bridged graphs and cop-win graphsRichard P. Anstee, Martin Farber. JCT, 44(1):22-28, 1988. [doi]

1987

On local convexity in graphsMartin Farber, Robert E. Jamison. DM, 66(3):231-247, 1987. [doi]

Bridged graphs and geodesic convexityMartin Farber. DM, 66(3):249-257, 1987. [doi]

1986

Concerning the achromatic number of graphsMartin Farber, Gena Hahn, Pavol Hell, Donald Miller. JCT, 40(1):21-39, 1986. [doi]

1985

Domination in Permutation GraphsMartin Farber, J. Mark Keil. jal, 6(3):309-321, 1985.

Steiner trees, connected domination and strongly chordal graphsKevin White, Martin Farber, William R. Pulleyblank. networks, 15(1):109-124, 1985. [doi]

1984

Characterizations of Totally Balanced MatricesRichard P. Anstee, Martin Farber. jal, 5(2):215-230, 1984.

Domination, independent domination, and duality in strongly chordal graphsMartin Farber. DAM, 7(2):115-130, 1984. [doi]

1983

Characterizations of strongly chordal graphsMartin Farber. DM, 43(2-3):173-189, 1983. [doi]

1982

Independent domination in chordal graphsMartin Farber. orl, 1(4):134-138, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL