Pages that link to "Item:Q2112310"

The following pages link to Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310):

Displaying 6 items.

• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
• Forests decomposition of graphs without 4-cycles (Q2926959) (← links)
• Partitions of some planar graphs into two linear forests (Q4209936) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Partitioning planar graphs into bounded degree forests (Q6585546) (← links)