标题:Edge-choosability of planar graphs without chordal 6-Cycles
作者:Liansheng Ge;Jiansheng Cai
作者机构:School of Computer Science and Technology Shandong University, Jinan, 250100, P. R. China;School of Mathematics and Information
来源:Utilitas mathematica
出版年:2011
页码:289-296
关键词:planar graph;edge-coloring;choosability;cycle;chord;com-binatorial problem
摘要:A graph G is edge-L-colorable, if for a given edge assignment L= {L(e) : e ∈ E(G)}, there exits a proper edge-coloring φ of G such that φ(e) ∈ L(e) for all e ∈ E(G). If G is edge-L-colorable for every edge assignment L with |L(e)| ≥ k for e ∈ E(G), then G is said to be edge-k-choosable. In this paper, we prove that if G is a planar graph without chordal 6-cycles, then G is edge-k-choosable, where k = max{8, Δ(G) + 1}.
资源类型:期刊论文
TOP