Martin Farber

Available identifiers

Publication	Date of Publication	Type
Absolute reflexive retracts and absolute bipartite retracts	1993-11-30	Paper
An upper bound on the number of cliques in a graph	1993-09-05	Paper
Algorithmic Aspects of Neighborhood Numbers	1993-06-29	Paper
On diameters and radii of bridged graphs	1989-01-01	Paper
Basis pair graphs of transversal matroids are connected	1989-01-01	Paper
On bridged graphs and cop-win graphs	1988-01-01	Paper
On local convexity in graphs	1987-01-01	Paper
Bridged graphs and geodesic convexity	1987-01-01	Paper
Convexity in Graphs and Hypergraphs	1986-01-01	Paper
Concerning the achromatic number of graphs	1986-01-01	Paper
An Analogue of the Shannon Capacity of a Graph	1986-01-01	Paper
Edge‐disjoint spanning trees: A connectedness theorem	1985-01-01	Paper
Steiner trees, connected domination and strongly chordal graphs	1985-01-01	Paper
Domination in permutation graphs	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3216676	1985-01-01	Paper
Characterizations of totally balanced matrices	1984-01-01	Paper
Domination, independent domination, and duality in strongly chordal graphs	1984-01-01	Paper
Characterizations of strongly chordal graphs	1983-01-01	Paper
Independent domination in chordal graphs	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3963030	1981-01-01	Paper

This page was built for person: Martin Farber