Efficient characterizations of \(n\)-chromatic absolute retracts

DOI10.1016/0095-8956(91)90051-KzbMath0751.05036MaRDI QIDQ1186122

Erwin Pesch, Hans-Jürgen Bandelt

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

isometric embeddingchromatic numberabsolute retractcoretractionefficient characterizations

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On neighborhood-Helly graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Colouring, constraint satisfaction, and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• A characterization of absolute retracts of n-chromatic graphs
• Hereditary modular graphs
• Dismantling absolute retracts of reflexive graphs
• Absolute retracts of bipartite graphs
• Absolute planar retracts and the four colour conjecture
• Minimal extensions of graphs to absolute retracts
• Products of absolute retracts

This page was built for publication: Efficient characterizations of \(n\)-chromatic absolute retracts