On the vertex-arboricity of planar graphs

DOI10.1016/j.ejc.2007.11.022zbMath1144.05024OpenAlexW2023875606MaRDI QIDQ2427551

Andre Raspaud, Wei Fan Wang

Publication date: 13 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.022

zbMATH Keywords

vertex-arboricity

Mathematics Subject Classification ID

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

Related Items (43)

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ LIST POINT ARBORICITY OF GRAPHS ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable ⋮ A flow theory for the dichromatic number ⋮ List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ Circular coloring of planar digraphs ⋮ Vertex arboricity of toroidal graphs with a forbidden cycle ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ 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 ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ Variable degeneracy on toroidal graphs ⋮ On inducing degenerate sums through 2-labellings ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ 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 ⋮ On the vertex-arboricity of planar graphs without 7-cycles ⋮ Partitioning a triangle-free planar graph into a forest and a forest of bounded degree ⋮ Dominating sets of maximal outerplanar graphs ⋮ List strong linear 2-arboricity of sparse graphs ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ List vertex-arboricity of planar graphs without intersecting 5-cycles ⋮ The extremal function for Petersen minors ⋮ A structural property of trees with an application to vertex-arboricity ⋮ List total arboricity of 2-degenerate graphs ⋮ Circular vertex arboricity ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ On the vertex partition of planar graphs into forests with bounded degree ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Treewidth of display graphs: bounds, brambles and 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 ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 ⋮ Vertex arboricity of planar graphs without chordal 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of specific lengths
• Erratum to: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• On point-linear arboricity of planar graphs
• Some 4-valent, 3-connected, planar, almost pancyclic graphs
• Choosability and edge choosability of planar graphs without five cycles
• Vertex and tree arboricities of graphs
• Vertex arboricity and maximum degree
• Decomposing a planar graph into degenerate graphs
• Parallel complexity of partitioning a planar graph into vertex-induced forests
• The point-arboricity of a graph
• B-sets and planar maps
• On the critical point-arboricity graphs
• On the linear vertex-arboricity of a planar graph
• An inequality involving the vertex arboricity and edge arboricity of a graph
• Critical Point-Arboritic Graphs
• Every planar map is four colorable
• A Note on the Vertex Arboricity of a Graph
• Point-Arboricity and Girth
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• The Point-Arboricity of Planar Graphs
• An Analogue to the Heawood Map-Colouring Problem

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