Absolute retracts of bipartite graphs
- 31 March 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 16 (3) , 191-215
- https://doi.org/10.1016/0166-218x(87)90058-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Hereditary modular graphsCombinatorica, 1988
- A characterization of absolute retracts of n-chromatic graphsDiscrete Mathematics, 1985
- Retracts of hypercubesJournal of Graph Theory, 1984
- Medians in median graphsDiscrete Applied Mathematics, 1984
- The smallest graph variety containing all pathsDiscrete Mathematics, 1983
- Betweenness isomorphisms of modular latticesArchiv der Mathematik, 1981
- Fixed-edge theorem for graphs with loopsJournal of Graph Theory, 1979
- Perfect Elimination and Chordal Bipartite GraphsJournal of Graph Theory, 1978
- Path length in the covering graph of a latticeDiscrete Mathematics, 1977
- Absolute retracts in graphsLecture Notes in Mathematics, 1974