Equitable partition of graphs into induced linear forests

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

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization 2020-02, Vol.39 (2), p.581-588
Hauptverfasser:	Zhang, Xin, Niu, Bei
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Convex and Discrete Geometry Forests Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	It is proved that the vertex set of any simple graph G can be equitably partitioned into k subsets for any integer k ≥ max { ⌈ Δ ( G ) + 1 2 ⌉ , ⌈ \| G \| 4 ⌉ } so that each of them induces a linear forest.
ISSN:	1382-6905 1573-2886
DOI:	10.1007/s10878-019-00498-8