On the vertex arboricity of planar graphs of diameter two
From MaRDI portal
Publication:2384426
DOI10.1016/j.disc.2006.10.017zbMath1126.05037OpenAlexW2028416478MaRDI QIDQ2384426
Publication date: 21 September 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.10.017
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (12)
Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ The maximum \(k\)-differential coloring problem ⋮ List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles ⋮ A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 ⋮ The extremal function for Petersen minors ⋮ Partition the vertices of a graph into one independent set and one acyclic set ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles ⋮ Structure and pancyclicity of maximal planar graphs with diameter two
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On point-linear arboricity of planar graphs
- Parallel concepts in graph theory
- Vertex arboricity and maximum degree
- The point-arboricity of a graph
- On the critical point-arboricity graphs
- Efficient algorithms for vertex arboricity of planar graphs
- Maximal planar graphs of diameter two
- On the linear vertex-arboricity of a planar graph
- Critical Point-Arboritic Graphs
- A Note on the Vertex Arboricity of a Graph
- Point-Arboricity and Girth
- The Point-Arboricity of Planar Graphs
This page was built for publication: On the vertex arboricity of planar graphs of diameter two