Pages that link to "Item:Q2146740"
From MaRDI portal
The following pages link to A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740):
Displaying 3 items.
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)