Some counterexamples associated with the three-color problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3482373 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3378931 (Why is no real title available?)
- Grötzsch's theorem on 3-colorings
- On a conjecture of B. Grünbaum
Cited in
(14)- Adapted list coloring of planar graphs
- Choosability of toroidal graphs without short cycles
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
- Note on 3-choosability of planar graphs with maximum degree 4
- Irreducible graphs in the Grünbaum-Havel 3-colour problem
- Planar 4-critical graphs with four triangles
- Decomposing a planar graph of girth 5 into an independent set and a forest
- A step towards the strong version of Havel's three color conjecture
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
- A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs
- A relaxation of Havel's 3-color problem
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- A note on the three color problem
This page was built for publication: Some counterexamples associated with the three-color problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1139601)
