Name
Abstract | ||
|---|---|---|
Wegner conjectured that for each planar graph G with maximum degree Δ at least 4, ¿ ( G 2 ) ¿ Δ + 5 if 4 ¿ Δ ¿ 7 , and ¿ ( G 2 ) ¿ ¿ 3 Δ 2 ¿ + 1 if Δ ¿ 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 λ p , q ( G ) ¿ ( 2 q - 1 ) Δ + 8 p + 14 q - 11 , where p and q are positive integers with p ¿ q . As a corollary, ¿ ( G 2 ) ¿ Δ + 12 and λ 2 , 1 ( G ) ¿ Δ + 19 . |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.dam.2013.08.039 | Discrete Applied Mathematics |
Keywords | Field | DocType |
positive integer,maximum degree,planar graph,planar graphs | Integer,Discrete mathematics,Combinatorics,Labelling,Degree (graph theory),Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
162 | C | 0166-218X |
Citations | PageRank | References |
2 | 0.38 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haiyang Zhu | 1 | 46 | 7.05 |
| Lifeng Hou | 2 | 2 | 0.38 |
| Wei Chen | 3 | 2 | 0.38 |
| Xinzhong Lu | 4 | 11 | 2.58 |