A recursive characterization of the absolute retracts in the class of n-chromatic (connected) graphs is given.
A characterization of absolute retracts
β Scribed by P. V. Chernikov
- Book ID
- 118772089
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1992
- Tongue
- English
- Weight
- 173 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0037-4466
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are g
A graph H is an absolute retract if for every isometric embedding h of , , into a graph G an edge-preserving map g from G to H exists such that An absolute retract is uniquely determined by its set of embeddable vertices. We may regard this set as a metric space. We also prove that a graph (finite