简介:
简介:ThechoicenumberofagraphG,denotedbyX1(G),istheminimumnumberksuchthatifalistofkcolorsisgiventoeachvertexofG,thereisavertexcoloringofGwhereeachvertexreceivesacolorfromitsownlistnomatterwhatthelistsare.Inthispaper,itisshowedthatX1(G)≤3foreachplanegraphofgirthnotlessthan4whichcontainsno6-,7-and9-cycles.