The L(p,q)-labelling of planar graphs without 4-cycles
点击次数：
第一作者：Haiyang Zhu
发表时间：2014-01-01
发表刊物：Discrete Applied Mathematics
所属单位：数理与信息工程学院
文献类型：期刊
卷号：Vol.162
页面范围：355-363
ISSN号：0166-218X
关键字：L(p,q)-labelling;Planar;graphs;Cycles;Wegner’s;conjecture
摘要：Wegner conjectured that for each planar graph G with maximum degree A at least 4, chi(G(2)) = 8. Let G be a planar graph without 4-cycles. In this paper, we discuss the L(p, q)-labelling of G, and show that lambda(p,q)(G) = q. As a corollary, chi(G(2)) <=
是否译文：否
上一条：磺胺二甲嘧啶在水溶液中的光化学降解
下一条：良性蠕虫的B+地址树扩散策略