标题:A note on list edge coloring of planar graphs without adjacent short cycles
作者:Hu, Linna; Song, Huimin; Wu, Jian-Liang
作者机构:[Hu, Linna; Wu, Jian-Liang] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.; [Song, Huimin] Shandong Univ, Sch Math & Stat, Weihai 更多
通讯作者:Song, HM
通讯作者地址:[Song, HM]Shandong Univ, Sch Math & Stat, Weihai 264209, Peoples R China.
来源:ARS COMBINATORIA
出版年:2019
卷:143
页码:3-12
关键词:planar graph; edge choosable; coloring; cycle
摘要:A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e is an element of E(G)}, there exists a proper edge-coloring phi of G such that phi(e) is an element of L(e) for all e is an element of E(G). If G is edge-L-colorable for every edge assignment L with vertical bar L(e)vertical bar >= k for all e is an element of E(G), then G is said to be edge-k-choosable. In this paper, we prove that a planar graph G is edge-(Delta(G) + 1)-choosable if any 4-cycle is not adjacent to a 3-cycle, or Delta(G) >= 6 and any two 4-cycles are not adjacent.
收录类别:SCIE
资源类型:期刊论文
TOP