Partitioning planar graphs into bounded degree forests

DOI10.1016/j.amc.2024.128705zbMATH Open1545.05185MaRDI QIDQ6585546

Yang Wang, Jiangxu Kong, Jiali Wang, Weifan Wang

Publication date: 12 August 2024

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

zbMATH Keywords

Could not fetch data.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex-arboricity of planar graphs without intersecting triangles
• On the vertex-arboricity of planar graphs without 7-cycles
• On acyclic colorings of planar graphs
• 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 bounded degree forests
• On the vertex-arboricity of planar graphs
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• On the linear vertex-arboricity of a planar graph
• Every planar map is four colorable
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• Decomposing a triangle-free planar graph into a forest and a subcubic forest
• Partitioning kite‐free planar graphs into two forests

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)