标题:Edge coloring of planar graphs which any two short cycles are adjacent at most once
作者:Ni, Wei-Ping; Wu, Jian-Liang
作者机构:[Ni, Wei-Ping] Zaozhuang Univ, Sch Math & Stat, Zaozhuang 277160, Shandong, Peoples R China.; [Wu, Jian-Liang] Shandong Univ, Sch Math, Jinan 250100 更多
通讯作者:Ni, WP
通讯作者地址:[Ni, WP]Zaozhuang Univ, Sch Math & Stat, Zaozhuang 277160, Shandong, Peoples R China.
来源:THEORETICAL COMPUTER SCIENCE
出版年:2014
卷:516
页码:133-138
DOI:10.1016/j.tcs.2013.11.011
关键词:Planar graph; Edge coloring; Maximum degree; Cycle
摘要:By applying discharging methods and properties of critical graphs, we proved that every simple planar graph G is of class 1 if Delta(G) = 6 and any k-cycle is adjacent to at most one k-cycle for some k (k = 3, 4, 5). (C) 2013 Elsevier B.V. All rights reserved.
收录类别:EI;SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84890571728&doi=10.1016%2fj.tcs.2013.11.011&partnerID=40&md5=181b98f4e07c2b947dc54ae09f5e58cb
TOP