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


Circular Coloring of Planar Digraphs
Authors:Guanghui Wang  Bin Liu  Jiguo Yu  Guizhen Liu
Institution:1. School of Mathematics, Shandong University, Jinan, 250100, Shandong, China
2. School of Computer Science, Qufu Normal University, Rizhao, 276826, Shandong, China
Abstract:Let D be a digraph. The circular chromatic number ${\chi_c(D)}$ and chromatic number ${\chi(D)}$ of D were proposed recently by Bokal et?al. Let ${\vec{\chi_c}(G)={\rm max}\{\chi_c(D)| D\, {\rm is\, an\, orientation\, of} G\}}$ . Let G be a planar graph and n?≥ 2. We prove that if the girth of G is at least ${\frac{10n-5}{3},}$ then ${\vec{\chi_c}(G)\leq \frac{n}{n-1}}$ . We also study the circular chromatic number of some special planar digraphs.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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