学科分类
/ 1
1 个结果
  • 简介:ThechoicenumberofagraphG,denotedbyX1(G),istheminimumnumberksuchthatifalistofkcolorsisgiventoeachvertexofG,thereisavertexcoloringofGwhereeachvertexreceivesacolorfromitsownlistnomatterwhatthelistsare.Inthispaper,itisshowedthatX1(G)≤3foreachplanegraphofgirthnotlessthan4whichcontainsno6-,7-and9-cycles.

  • 标签: 平面图 二部图 EULER公式 可选择性