Partitioning planar graph of girth 5 into two forests with maximum degree 4.

DOI10.21136/cmj.2024.0394-21MaRDI QIDQ6584423

Weifan Wang, André Raspaud, Min Chen, Weiqiang Yu

Publication date: 7 August 2024

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

girthforestvertex partitionmaximum degree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
• Vertex-arboricity of planar graphs without intersecting triangles
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Near-colorings: non-colorable graphs and NP-completeness
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
• On the vertex-arboricity of planar graphs
• Defective 2-colorings of sparse graphs
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• On the linear vertex-arboricity of a planar graph
• Improper choosability of graphs and maximum average degree
• The Point-Arboricity of Planar Graphs
• 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

This page was built for publication: Partitioning planar graph of girth 5 into two forests with maximum degree 4.