Vertex arboricity of planar graphs without intersecting 5-cycles

Hua Cai, Jianliang Wu () and Lin Sun
Additional contact information
Hua Cai: Changji University
Jianliang Wu: Shandong University
Lin Sun: Changji University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 2, No 4, 365-372

Abstract: Abstract The vertex arboricity va(G) of a graph G is the minimum number of colors the vertices can be colored so that each color class induces a forest. It was known that $$va(G)\le 3$$ v a ( G ) ≤ 3 for every planar graph G. In this paper, we prove that $$va(G)\le 2$$ v a ( G ) ≤ 2 if G is a planar graph without intersecting 5-cycles.

Keywords: Vertex arboricity; Planar graph; Cycle; Intersecting; Coloring (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0168-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0168-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0168-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().