Choosability of K5-minor-free graphs

被引：15

作者：

Skrekovski, R ^{[1
]}

机构：

[1] Univ Ljubljana, Dept Math, Ljubljana 1111, Slovenia

来源：

DISCRETE MATHEMATICS | 1998年 / 190卷 / 1-3期

关键词：

graph; coloring; list coloring;

D O I：

10.1016/S0012-365X(98)00158-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：223 / 226

页数：4

共 7 条

[1]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[2]

Diestel R., 1997, Graph Theory

[3]

Erd o P., 1979, Congr. Numer., V26, P125

[4] UBER EINEN SATZ VON WAGNER,K. ZUM VIERFARBENPROBLEM [J].

HALIN, R .

MATHEMATISCHE ANNALEN, 1964, 153 (01) :47-62

[5] EVERY PLANAR GRAPH IS 5-CHOOSABLE [J].

THOMASSEN, C .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 62 (01) :180-181

[6]

Vizing V.G., 1976, Diskret. Analiz. no. 29, Metody Diskret. Anal. v Teorii Kodovi Skhem, V29, P3

[7] Concerning a property of uniform complexes. [J].

Wagner, K .

MATHEMATISCHE ANNALEN, 1937, 114 :570-590

← 1 →