Pages that link to "Item:Q2449153"

The following pages link to \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 (Q2449153):

Displaying 4 items.

• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
• 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) (← links)