Absolute planar retracts and the four colour conjecture
From MaRDI portal
Publication:2562866
DOI10.1016/0095-8956(74)90040-9zbMath0267.05102OpenAlexW2069527258MaRDI QIDQ2562866
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Absolute neighborhood retracts (55M15)
Related Items (15)
A characterization of absolute retracts of n-chromatic graphs ⋮ Absolute retracts of split graphs ⋮ On the complexity of H-coloring ⋮ Homomorphically full graphs ⋮ Revolutionaries and spies: spy-good and spy-bad graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Retract rigid Cartesian products of graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Efficient characterizations of \(n\)-chromatic absolute retracts ⋮ Absolute reflexive retracts and absolute bipartite retracts ⋮ Retracts of strong products of graphs ⋮ Products of absolute retracts ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ The smallest graph variety containing all paths ⋮ A retraction problem in graph theory
Cites Work
This page was built for publication: Absolute planar retracts and the four colour conjecture
