Partition of a planar graph with girth 6 into two forests with chain length at most 4
From MaRDI portal
Publication:5264731
Recommendations
Cites work
- scientific article; zbMATH DE number 4010565 (Why is no real title available?)
- A path(ological) partition problem
- A survey of hereditary properties of graphs
- List strong linear 2-arboricity of sparse graphs
- Near-proper vertex 2-colorings of sparse graphs
- Partition of a planar graph with girth 7 into two star forests
- Partition problems and kernels of graphs
- Partitioning sparse plane graphs into two induced subgraphs of small degree
- Path partitions of planar graphs
Cited in
(10)- Path partition of planar graphs with girth at least six
- Partition of a planar graph with girth 7 into two star forests
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- Path partitioning planar graphs of girth 4 without adjacent short cycles
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Partitioning sparse plane graphs into two induced subgraphs of small degree
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Partitioning planar graphs with girth at least 6 into bounded size components
- Colouring planar graphs with bounded monochromatic components
- Partitioning a planar graph of girth 10 into a forest and a matching
This page was built for publication: Partition of a planar graph with girth 6 into two forests with chain length at most 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264731)
