上传者: weixin_38548434
|
上传时间:2024/4/30 6:27:44
|
文件大小:310KB
|
文件类型:PDF
Anoteontheminimumnumberofchoosabilityofplanargraphs
Theproblemofminimumnumberofchoosabilityofgraphswasfirstintroduced.byVizing.Itappearsinsomepracticalproblemswhenconcerningfrequency.assignment.Inthispaper,westudytwoimportantlistcoloring,listedgecoloringand.listtotalcoloring.Weprovethatχl(G)=Δandχl(G)=Δ