A note on vertex partitions
Combinatorics
2011-07-12 v1
Abstract
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.
Cite
@article{arxiv.1107.1735,
title = {A note on vertex partitions},
author = {Landon Rabern},
journal= {arXiv preprint arXiv:1107.1735},
year = {2011}
}