Pages that link to "Item:Q458589"

The following pages link to Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589):

Displaying 7 items.

• 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)
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
• Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)