Hits :

First Author : Haiyang Zhu

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.162

Page Number : 355-363

ISSN : 0166-218X

Translation or Not : no

Key Words : L(p,q)-labelling;Planar;graphs;Cycles;Wegner’s;conjecture

Abstract : 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)) <=