The following pages link to (Q3139765):
Displaying 50 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Steinberg's conjecture is false (Q345097) (← links)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← 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)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← links)
- Parity-constrained triangulations with Steiner points (Q489340) (← links)
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← 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)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← 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)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- 4-chromatic edge critical Grötzsch-Sachs graphs (Q1025526) (← 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)
- Irreducible graphs in the Grünbaum-Havel 3-colour problem (Q1126208) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- A new proof of Grünbaum's 3 color theorem (Q1357735) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- Circular backbone colorings: on matching and tree backbones of planar graphs (Q1627845) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- A note on the three color problem (Q1805376) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← 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)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- Nowhere-zero 3-flows in toroidal graphs (Q2072180) (← links)
