ThechoicenumberofagraphG,denotedbyX1(G),istheminimumnumberksuchthatifalistofkcolorsisgiventoeachvertexofG,thereisavertexcoloringofGwhereeachvertexreceivesacolorfromitsownlistnomatterwhatthelistsare.Inthispaper,itisshowedthatX1(G)≤3foreachplanegraphofgirthnotlessthan4whichcontainsno6-,7-and9-cycles.
高校应用数学学报：英文版（B辑）
2004年1期
