Equitable partition of graphs into induced linear forests

Xin Zhang () and Bei Niu ()
Additional contact information
Xin Zhang: Xidian University
Bei Niu: Xidian University

Journal of Combinatorial Optimization, 2020, vol. 39, issue 2, No 15, 588 pages

Abstract: Abstract It is proved that the vertex set of any simple graph G can be equitably partitioned into k subsets for any integer $$k\ge \max \{\big \lceil \frac{\Delta (G)+1}{2}\big \rceil ,\big \lceil \frac{|G|}{4}\big \rceil \}$$k≥max{⌈Δ(G)+12⌉,⌈|G|4⌉} so that each of them induces a linear forest.

Keywords: Equitable coloring; Vertex arboricity; Linear forest (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00498-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:39:y:2020:i:2:d:10.1007_s10878-019-00498-8

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

DOI: 10.1007/s10878-019-00498-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 ().