Pages that link to "Item:Q1988563"

The following pages link to Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563):

Displaying 11 items.

• Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• (Q5878782) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)