Vertex arboricity of planar graphs without chordal 6-cycles
From MaRDI portal
Publication:2868169
DOI10.1080/00207160.2012.727989zbMath1278.05100MaRDI QIDQ2868169
Publication date: 23 December 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.727989
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic, Vertex arboricity of planar graphs without intersecting 5-cycles, Planar graphs without chordal 6-cycles are 4-choosable, A structural property of trees with an application to vertex-arboricity, An analogue of DP-coloring for variable degeneracy and its applications, A generalization of some results on list coloring and DP-coloring, A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles, Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
Cites Work
- Unnamed Item
- Vertex-arboricity of planar graphs without intersecting triangles
- On the vertex-arboricity of planar graphs without 7-cycles
- Planar graphs without cycles of specific lengths
- Choosability and edge choosability of planar graphs without five cycles
- Vertex and tree arboricities of graphs
- Vertex arboricity and maximum degree
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
- Efficient algorithms for acyclic colorings of graphs
- On the vertex-arboricity of planar graphs
- The point-arboricity of a graph
- B-sets and planar maps
- Efficient algorithms for vertex arboricity of planar graphs
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- An inequality involving the vertex arboricity and edge arboricity of a graph
- Critical Point-Arboritic Graphs
- A Note on the Vertex Arboricity of a Graph
- The Point-Arboricity of Planar Graphs