On the vertex partition of planar graphs into forests with bounded degree

DOI10.1016/J.AMC.2020.125032MaRDI QIDQ2294901zbMATH OpenOpenAlexFDO

Authors Yang Wang, Danjun Huang, Stephen Finbow

Publication date 12 February 2020

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

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

zbMATH Keywords

forestgirthmaximum degreevertex partition

Mathematics Subject Classification ID

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

Recommendations

• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• scientific article; zbMATH DE number 6125173
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree

Cites work

• Acyclic dominating partitions
• Acyclic improper choosability of subcubic graphs
• Defective 2-colorings of sparse graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• scientific article; zbMATH DE number 3565019 (Why is no real title available?)
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• Improper choosability of graphs and maximum average degree
• Near-colorings: non-colorable graphs and NP-completeness
• 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
• Planar graphs with girth at least 5 are (3, 5)-colorable
• Vertex-arboricity of planar graphs without intersecting triangles

Cited in

(21)

• Simple planar graph partition into three forests
• Partitioning into graphs with only small components
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
• scientific article; zbMATH DE number 5919777 (Why is no real title available?)
• A Rooted-Forest Partition with Uniform Vertex Demand
• scientific article; zbMATH DE number 7366688 (Why is no real title available?)
• Vertex partitions into an independent set and a forest with each component small
• scientific article; zbMATH DE number 975383 (Why is no real title available?)
• Covering planar graphs with forests, one having a bounded maximum degree
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• Path partition of planar graphs with girth at least six
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
• Partitioning planar graphs into bounded degree forests
• A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable
• Planar graphs without cycles of length 3, 4, and 6 are (3, 3)-colorable
• Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests
• A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable

This page was built for publication: On the vertex partition of planar graphs into forests with bounded degree

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