Pages that link to "Item:Q1139601"
From MaRDI portal
The following pages link to Some counterexamples associated with the three-color problem (Q1139601):
Displayed 14 items.
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs (Q793751) (← links)
- A relaxation of Havel's 3-color problem (Q963412) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- Irreducible graphs in the Grünbaum-Havel 3-colour problem (Q1126208) (← links)
- A note on the three color problem (Q1805376) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)