Absolute planar retracts and the four colour conjecture

DOI10.1016/0095-8956(74)90040-9MaRDI QIDQ2562866zbMATH OpenOpenAlexFDO

Authors Pavol Hell

Publication date 1974

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

Full work available at URL https://doi.org/10.1016/0095-8956(74)90040-9

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Absolute neighborhood retracts (55M15) Relations of low-dimensional topology with graph theory (57M15)

Cited in

(15)

• A surprising permanence of old motivations (a not-so-rigid story)
• A retraction problem in graph theory
• A characterization of absolute retracts of n-chromatic graphs
• On the complexity of H-coloring
• Efficient characterizations of \(n\)-chromatic absolute retracts
• Absolute retracts of split graphs
• The smallest graph variety containing all paths
• Homomorphically full graphs
• Revolutionaries and spies: spy-good and spy-bad graphs
• Beyond Helly graphs: the diameter problem on absolute retracts
• Colouring, constraint satisfaction, and complexity
• Products of absolute retracts
• Absolute reflexive retracts and absolute bipartite retracts
• Retracts of strong products of graphs
• Retract rigid Cartesian products of graphs

This page was built for publication: Absolute planar retracts and the four colour conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562866)