Choice number of 3-colorable elementary graphs

被引：15

作者：

Gravier, S ^{[1
]}

Maffray, F ^{[1
]}

机构：

[1] IMAG LAB GRENOBLE,LSD2,CNRS,F-38041 GRENOBLE 9,FRANCE

来源：

DISCRETE MATHEMATICS | 1997年 / 165卷

关键词：

D O I：

10.1016/S0012-365X(96)00182-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free graphs, in view of the conjecture that this is true for every claw-free graph.

引用

页码：353 / 358

页数：6

共 6 条

[1] RECOGNIZING CLAW-FREE PERFECT GRAPHS [J].

CHVATAL, V ;

SBIHI, N .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 44 (02) :154-176

[2] THE LIST CHROMATIC INDEX OF A BIPARTITE MULTIGRAPH [J].

GALVIN, F .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (01) :153-158

[3]

GRAVIER S, 1995, LSD2IMAG

[4] SOME UPPER-BOUNDS ON THE TOTAL AND LIST CHROMATIC-NUMBERS OF MULTIGRAPHS [J].

HAGGKVIST, R ;

CHETWYND, A .

JOURNAL OF GRAPH THEORY, 1992, 16 (05) :503-516

[5]

MAFFRAY F, 1995, LSD2IMAG

[6]

Taylor R., 1980, C NUMER, V26, P122

← 1 →