The dominating 4-colour theorem
From MaRDI portal
Cites work
- 4‐Separations in Hajós graphs
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- A new perspective on vertex connectivity
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Approximation algorithms for connected dominating sets
- Connected Domination and Spanning Trees with Many Leaves
- Dominating K_t-models
- Every Planar Map is Four Colorable
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph Theory and Probability
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Hadwiger's conjecture is true for almost every graph
- Hajos' graph-coloring conjecture: Variations and counterexamples
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- Improved bounds for spanning trees with many leaves
- On a coloring conjecture of Hajós
- On Hadwiger's Number and the Stability Number
- On the conjecture of Hajos
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs
- Rigid partitions: from high connectivity to random graphs
- Some remarks on Hajós' conjecture
- Spanning trees with few non-leaves
- Spanning Trees with Many Leaves
- Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs
- Sur le problème des courbes gauches en topologie.
- The four-colour theorem
- The Kelmans-Seymour conjecture. I: Special separations
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. IV: A proof
- Tight Bounds on Vertex Connectivity Under Sampling
- Wheels in planar graphs and Hajós graphs
- Über eine Eigenschaft der ebenen Komplexe.
This page was built for publication: The dominating 4-colour theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396088)
