Title
A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
Abstract
The vertex arboricity va(G) of G is the smallest integer k which the acyclic partition of V (G) make the vertex set V (G) be partitioned into k subsets which each subset induces an acyclic graph. In this paper, we mainly study vertex arboricity of planar graphs, and we prove that if there is without 4-cycles intersecting with 6-cycles, then va(G) <= 2 (C) 2020 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2020
10.1016/j.tcs.2020.06.009
THEORETICAL COMPUTER SCIENCE
Keywords
DocType
Volume
Intersecting,Planar graphs,Vertex arboricity
Journal
836
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Xuyang Cui100.34
Wenshun Teng200.68
ying liu336446.92
Huijuan Wang4517.52