On the vertex-arboricity of planar graphs without 7-cycles

DOI10.1016/j.disc.2012.03.035zbMath1245.05029OpenAlexW2083600948MaRDI QIDQ442319

Danjun Huang, Wai Chee Shiu, Wei Fan Wang

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.035

zbMATH Keywords

cycleplanar graphvertex arboricity

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (19)

Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ Vertex arboricity of toroidal graphs with a forbidden cycle ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles ⋮ Partitioning kite‐free planar graphs into two forests ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 ⋮ List vertex-arboricity of planar graphs without intersecting 5-cycles ⋮ The extremal function for Petersen minors ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ On the vertex partition of planar graphs into forests with bounded degree ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles ⋮ Cover and variable degeneracy ⋮ Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic ⋮ Vertex arboricity of planar graphs without chordal 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On point-linear arboricity of planar graphs
• Vertex and tree arboricities of graphs
• Vertex arboricity and maximum degree
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• Efficient algorithms for vertex arboricity of planar graphs
• On the linear vertex-arboricity of a planar graph
• Planar Graphs without 7-Cycles Are 4-Choosable
• An inequality involving the vertex arboricity and edge arboricity of a graph
• Critical Point-Arboritic Graphs
• The Point-Arboricity of Planar Graphs

This page was built for publication: On the vertex-arboricity of planar graphs without 7-cycles