Pages that link to "Item:Q1026007"

The following pages link to Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007):

Displaying 19 items.

• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
• Steinberg's conjecture is false (Q345097) (← links)
• A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← 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)
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
• Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
• A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles (Q2092419) (← links)
• Further extensions of the Grötzsch theorem (Q2124638) (← links)
• Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
• Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
• Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
• (Q2857451) (← links)
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
• Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)