Title of article
Choice number of 3-colorable elementary graphs Original Research Article
Author/Authors
Sylvain Gravier and Julien Moncel، نويسنده , , Frédéric Maffray، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
6
From page
353
To page
358
Abstract
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.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951734
Link To Document