A Note on the Vertex Arboricity of a Graph

DOI10.1137/0402007zbMath0684.05028OpenAlexW2017363710MaRDI QIDQ4733881

S. Louis Hakimi, Edward F. Schmeichel

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1137/0402007

zbMATH Keywords

Hamiltonian graphvertex arboricitydual graphmaximal planar graphsedge arboricity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (22)

Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ On the vertex arboricity of planar graphs of diameter two ⋮ Vertex arboricity and vertex degrees ⋮ A flow theory for the dichromatic number ⋮ 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 ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ On inducing degenerate sums through 2-labellings ⋮ On the vertex-arboricity of planar graphs ⋮ Partitioning kite‐free planar graphs into two forests ⋮ On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 ⋮ Best monotone degree conditions for graph properties: a survey ⋮ A structural property of trees with an application to vertex-arboricity ⋮ On generalized perfect graphs: Bounded degree and bounded edge perfection ⋮ On Barnette's conjecture ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Vertex arboricity of planar graphs without chordal 6-cycles ⋮ Relaxed chromatic numbers of graphs

This page was built for publication: A Note on the Vertex Arboricity of a Graph