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


2-Distance coloring of planar graphs with girth 5
Authors:Wei Dong  Baogang Xu
Institution:1.School of Information and Engineering,Nanjing XiaoZhuang University,Nanjing,China;2.Institute of Mathematics, School of Mathematical Sciences,Nanjing Normal University,Nanjing,China
Abstract:A vertex coloring is said to be 2-distance if any two distinct vertices of distance at most 2 receive different colors. Let G be a planar graph with girth at least 5. In this paper, we prove that G admits a 2-distance coloring with at most \(\Delta (G)+3\) colors if \(\Delta (G)\ge 339\).
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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