Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

A note on vertex partitions

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 Lovasz, Catlin, Kostochka and Rabern.

This document is currently being converted. Please check back in a few minutes.