Pages that link to "Item:Q6059078"
From MaRDI portal
The following pages link to Path partition of planar graphs with girth at least six (Q6059078):
Displaying 9 items.
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Plane triangulations are 6-partitionable (Q1849915) (← links)
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- Partitioning sparse plane graphs into two induced subgraphs of small degree (Q2454534) (← links)
- Path partitions of planar graphs (Q2481195) (← links)
- (Q4797463) (← links)
- On the path partition number of 6‐regular graphs (Q6057632) (← links)