The following pages link to On a conjecture of B. Grünbaum (Q5567010):
Displayed 30 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- On 3-colorings of plane graphs (Q705042) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← 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)
- Some counterexamples associated with the three-color problem (Q1139601) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← 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)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)