List-edge-coloring of planar graphs without 6-cycles with three chords
J. Comb. Optim.(2017)
摘要
graph G is edge- k -choosable if, whenever we are given a list L ( e ) of colors with |L(e)|≥ k for each e∈ E(G) , we can choose a color from L ( e ) for each edge e such that no two adjacent edges receive the same color. In this paper we prove that if G is a planar graph, and each 6-cycle contains at most two chords, then G is edge- k -choosable, where k=max{8,Δ (G)+1} , and edge- t -choosable, where t=max{10,Δ (G)} .
更多查看译文
关键词
Edge-choosable,List-edge-chromatic-number,Cycle,Planar graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络