Vertex arboricity of toroidal graphs with a forbidden cycle
From MaRDI portal
Publication:400411
DOI10.1016/J.DISC.2014.06.011zbMath1298.05263arXiv1304.1847OpenAlexW2148784152MaRDI QIDQ400411
Publication date: 21 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.1847
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)
Related Items (10)
Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ 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 ⋮ Variable degeneracy on toroidal graphs ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ 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
Cites Work
- Vertex-arboricity of planar graphs without intersecting triangles
- On the vertex-arboricity of planar graphs without 7-cycles
- On list vertex 2-arboricity of toroidal graphs without cycles of specific length
- On the vertex-arboricity of planar graphs
- The point-arboricity of a graph
- B-sets and planar maps
- Critical Point-Arboritic Graphs
- A Note on the Vertex Arboricity of a Graph
- Point-Arboricity and Girth
- The Point-Arboricity of Planar Graphs
- An Analogue to the Heawood Map-Colouring Problem
This page was built for publication: Vertex arboricity of toroidal graphs with a forbidden cycle