93
Views
9
CrossRef citations to date
0
Altmetric
Section A

Vertex arboricity of planar graphs without chordal 6-cycles

&
Pages 258-272 | Received 02 Aug 2010, Accepted 03 Sep 2012, Published online: 18 Oct 2012
 

Abstract

The vertex arboricity va(G) of a graph G is the minimum number of colours the vertices can be coloured so that each colour class induces a forest. It was known that va(G)≤3 for every planar graph G, and the problem of computing vertex arboricity of graphs is NP-hard. In this paper, we prove that va(G)≤2 if G is a planar graph without chordal 6-cycles. This extends a result by Raspaud and Wang [On the vertex-arboricity of planar graphs, Eur. J. Combin. 29 (2008), pp. 1064–1075].

2000 AMS Subject Classification:

Acknowledgements

The work of Danjun Huang is supported by the Foundation of Zhejiang Educational Committee (Y201226078) and the work of Weifan Wang is supported by NSFC (No. 11071223), ZJNSF (No. Z6090150), ZJIP (No. T200905), ZSDZZZZXK13 and IP-OCNS-ZJNU.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.