Vertex arboricity of planar graphs without intersecting 5-cycles

DOI10.1007/s10878-017-0168-3zbMath1386.05053OpenAlexW2760519613MaRDI QIDQ1702820

Hua Cai, Lin Sun, Jian Liang Wu

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0168-3

zbMATH Keywords

cycleplanar graphcoloringvertex arboricityintersecting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

A generalization of some results on list coloring and DP-coloring ⋮ Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Cover and variable degeneracy ⋮ Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic

Cites Work

• Vertex arboricity of toroidal graphs with a forbidden cycle
• 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
• On the vertex-arboricity of planar graphs
• On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2
• The point-arboricity of a graph
• Vertex arboricity of planar graphs without chordal 6-cycles
• Efficient algorithms for vertex arboricity of planar graphs
• The Point-Arboricity of Planar Graphs

This page was built for publication: Vertex arboricity of planar graphs without intersecting 5-cycles