Pages that link to "Item:Q2371269"

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

Displaying 7 items.

• Steinberg's conjecture is false (Q345097) (← links)
• Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← 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)
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
• Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)