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

被引:36
作者
Borodin, OV [1 ]
Kostochka, AV
Toft, B
机构
[1] Russian Acad Sci, Inst Math, Siberian Branch, Novosibirsk 630090, Russia
[2] Novosibirsk State Univ, Novosibirsk 630090, Russia
[3] Odense Univ, Odense, Denmark
关键词
graph colouring; list colouring; point partition numbers; degeneracy; vertex function;
D O I
10.1016/S0012-365X(99)00221-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 G(l),...,G(s) such that G(i) is strictly f(i)-degenerate, given nonnegative-integer-valued functions f(l),...,f(s) whose sum is bounded below at each vertex by the degree of that vertex. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:101 / 112
页数:12
相关论文
共 17 条
  • [1] Bollobas Bela, 1979, Bull. London Math. Soc., V11, P113
  • [2] Borodin O. V., 1977, 4 ALL UN C THEOR CYB, P127
  • [3] UPPER BOUND OF A GRAPHS CHROMATIC NUMBER, DEPENDING ON GRAPHS DEGREE AND DENSITY
    BORODIN, OV
    KOSTOCHKA, AV
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1977, 23 (2-3) : 247 - 250
  • [4] BORODIN OV, 1979, THESIS NOVOSIBIRSK
  • [5] BORODIN OV, 1976, METHODS DISCRETE ANA, V28, P3
  • [6] Erd o P., 1979, Congr. Numer., V26, P125
  • [7] FRANKLIN F, 1934, J MATH PHYS, V13, P363
  • [8] GALLAI T, 1963, PUBL MATH I HUNG, V8, P165
  • [9] Gerencser L., 1965, Mat. Lapok, V16, P274
  • [10] KRONK HV, 1975, J LOND MATH SOC, V9, P459