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):

Displayed 5 items.

• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) ‎ (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) ‎ (← 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)