The following pages link to A note on the three color problem (Q1805376):
Displaying 39 items.
- Steinberg's conjecture is false (Q345097) (← links)
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 (Q394211) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← 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 adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
- A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles (Q2092419) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- A Steinberg-like approach to describing faces in 3-polytopes (Q2361077) (← links)
- On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153) (← links)
- On 3-colorable planar graphs without prescribed cycles (Q2461207) (← links)
- Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
- A 3-color theorem on plane graphs without 5-circuits (Q2644333) (← links)
- (Q2857451) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)
