On the choice number of claw-free perfec
β
Sylvain Gravier; FrΓ©dΓ©ric Maffray
π
Article
π
2004
π
Elsevier Science
π
English
β 273 KB
We prove that every 3-chromatic claw-free perfect graph is 3-choosable.