On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2

DOI10.1016/j.disc.2013.12.017zbMath1283.05216OpenAlexW2146839992MaRDI QIDQ2436824

Jinjiang Yuan, Fei Huang, Xiumei Wang

Publication date: 27 February 2014

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

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

zbMATH Keywords

vertex-arboricityinduced forestminor-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Distance in graphs (05C12)

Related Items (3)

A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ The extremal function for Petersen minors

Cites Work

• Unnamed Item
• Unnamed Item
• On the vertex-arboricity of planar graphs without 7-cycles
• Vertex arboricity and maximum degree
• On the vertex arboricity of planar graphs of diameter two
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• B-sets and planar maps
• Bemerkungen zum Vierfarbenproblem
• Critical Point-Arboritic Graphs
• A Note on the Vertex Arboricity of a Graph
• The Point-Arboricity of Planar Graphs

This page was built for publication: On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2