Pages that link to "Item:Q709301"

The following pages link to Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301):

Displaying 6 items.

• Steinberg's conjecture is false (Q345097) (← 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)
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• Planar graphs without short even cycles are near-bipartite (Q777449) (← links)