Elsevier

Discrete Mathematics

Volume 214, Issues 1–3, 21 March 2000, Pages 101-112
Discrete Mathematics

Variable degeneracy: extensions of Brooks’ and Gallai's theorems

https://doi.org/10.1016/S0012-365X(99)00221-6Get rights and content
Under an Elsevier user license
open archive

Abstract

We introduce the concept of variable degeneracy of a graph extending that of k-degeneracy. This makes it possible to give a common generalization of the point partition numbers and the list chromatic number. In particular, the list point arboricity of a graph is considered. We extend Brooks’ and Gallai's theorems in terms of covering the vertices of a graph by disjoint induced subgraphs G1,…,Gs such that Gi is strictly fi-degenerate, given nonnegative-integer-valued functions f1,…,fs whose sum is bounded below at each vertex by the degree of that vertex.

Keywords

Graph colouring
List colouring
Point partition numbers
Degeneracy
Vertex function

Cited by (0)

1

This work was partially supported by the Network DIMANET of the European Union and the grant NQ4300 of International Science Foundation and Russian Government.

2

This work was partially supported by the grant 96-01-01614 of the Russian Foundation for Fundamental Research and the grant RPY300 of International Science Foundation and Russian Government.

3

This work was partially supported by the grant for discrete mathematics of the Danish Natural Science Research Council.