On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2
From MaRDI portal
Publication:2436824
DOI10.1016/j.disc.2013.12.017zbMath1283.05216MaRDI 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
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C83: Graph minors
05C12: Distance in graphs
Related Items
Vertex arboricity of planar graphs without intersecting 5-cycles, The extremal function for Petersen minors, A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
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