Title of article
On the choice number of claw-free perfect graphs Original Research Article
Author/Authors
Sylvain Gravier and Julien Moncel، نويسنده , , Frédéric Maffray، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
8
From page
211
To page
218
Abstract
We prove that every 3-chromatic claw-free perfect graph is 3-choosable.
Keywords
Graph coloring , List coloring , Claw-free graphs
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948773
Link To Document