Partition of a planar graph with girth 6 into two forests with chain length at most 4
DOI10.1134/S199047891403003XzbMATH Open1324.05034MaRDI QIDQ5264731FDOQ5264731
Authors: D. Zh. Zambalaeva, A. N. Glebov Edit this on Wikidata
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- A survey of hereditary properties of graphs
- Path partitions of planar graphs
- List strong linear 2-arboricity of sparse graphs
- Near-proper vertex 2-colorings of sparse graphs
- A path(ological) partition problem
- Partition problems and kernels of graphs
- Partitioning sparse plane graphs into two induced subgraphs of small degree
- Partition of a planar graph with girth 7 into two star forests
Cited In (10)
- 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
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Partitioning sparse plane graphs into two induced subgraphs of small degree
- 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
- Path partition of planar graphs with girth at least six
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)
