Partitioning planar graphs into bounded degree forests

DOI10.1016/j.amc.2024.128705MaRDI QIDQ6585546zbMATH OpenFDO

Authors Yang Wang, Jiali Wang, Weifan Wang, Jiangxu Kong

Publication date 12 August 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2024.128705

zbMATH Keywords

cycleforestplanar graphvertex partition

Mathematics Subject Classification ID

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

Recommendations

• On the vertex partition of planar graphs into forests with bounded degree
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable

Cites work

• Decomposing a triangle-free planar graph into a forest and a subcubic forest
• Every planar map is four colorable
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• On acyclic colorings of planar graphs
• On the linear vertex-arboricity of a planar graph
• On the vertex-arboricity of planar graphs
• On the vertex-arboricity of planar graphs without 7-cycles
• Partitioning kite‐free planar graphs into two forests
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• Threshold for path colorings of planar graphs
• Vertex-arboricity of planar graphs without intersecting triangles

Cited in

(2)

• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
• Every planar graph without 4- and 6-cycles is (2,5)-colorable

This page was built for publication: Partitioning planar graphs into bounded degree forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585546)