首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
Authors:Rui Li  Baogang Xu
Institution:aSchool of Mathematical Sciences, Nanjing Normal University, 1 Wenyuan Road, Yadong New District, Nanjing, 210046, China;bNormal College, Shihezi University, Shihezi, Xinjiang, 832003, China
Abstract:Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. We prove that View the MathML source if Δ(G)≥6, and View the MathML source and View the MathML source if Δ(G)≥8, where View the MathML source and View the MathML source denote the list edge chromatic number and list total chromatic number of G, respectively.
Keywords:List total coloring  List edge coloring  Planar graphs
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号