Equitable vertex arboricity of 5-degenerate graphs

Guantao Chen, Yuping Gao (), Songling Shan, Guanghui Wang and Jianliang Wu ()
Additional contact information
Guantao Chen: Georgia State University
Yuping Gao: Shandong University
Songling Shan: Vanderbilt University
Guanghui Wang: Shandong University
Jianliang Wu: Shandong University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 2, No 8, 426-432

Abstract: Abstract Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of any simple graph G can be equitably partitioned into m subsets so that each subset induces a forest, where $$\Delta (G)$$ Δ ( G ) is the maximum degree of G and m is an integer with $$m\ge \lceil \frac{\Delta (G)+1}{2}\rceil $$ m ≥ ⌈ Δ ( G ) + 1 2 ⌉ . This conjecture is verified for 5-degenerate graphs in this paper.

Keywords: Graph; Equitable coloring; Vertex arboricity; Equitable vertex arboricity; 5-Degenerate graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-9997-8 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:34:y:2017:i:2:d:10.1007_s10878-016-9997-8

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

DOI: 10.1007/s10878-016-9997-8

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 ().