Pages that link to "Item:Q1637126"

The following pages link to Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126):

Displaying 10 items.

• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
• 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)
• DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← 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)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Graph partitions under average degree constraint (Q6187347) (← links)