A note on vertex partitions
classification
🧮 math.CO
keywords
lemmavertexboundedcatlindegreeextendsgeneralgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.