Partition of a planar graph with girth 6 into two forests with chain length at most 4

DOI10.1134/S199047891403003XzbMath1324.05034MaRDI QIDQ5264731

D. Zh. Zambalaeva, Alekseĭ Nikolaevich Glebov

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

girthplanar graphpath partition

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Path partitioning planar graphs of girth 4 without adjacent short cycles ⋮ Colouring planar graphs with bounded monochromatic components ⋮ 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

Cites Work

• Partitioning sparse plane graphs into two induced subgraphs of small degree
• Path partitions of planar graphs
• List strong linear 2-arboricity of sparse graphs
• A survey of hereditary properties of graphs
• Partition problems and kernels of graphs
• A path(ological) partition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partition of a planar graph with girth 6 into two forests with chain length at most 4