The -labelling of planar graphs without 4-cycles.
点击次数：
第一作者：Zhu, Haiyang
发表时间：2014-01-01
发表刊物：Discrete Applied Mathematics
所属单位：数理与信息工程学院
文献类型：期刊
卷号：Vol.162
页面范围：355-363
ISSN号：0166-218X
摘要：Wegner conjectured that for each planar graph with maximum degree at least 4, if , and if . Let be a planar graph without 4-cycles. In this paper, we discuss the -labelling of , and show that , where and are positive integers with . As a corollary, and .
是否译文：否