Pages that link to "Item:Q393460"

The following pages link to Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460):

Displaying 5 items.

• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← 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 graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)