On (<Emphasis Type="Italic">p</Emphasis>, 1)-total labelling of 1-planar graphs |
| |
Authors: | Xin Zhang Yong Yu Guizhen Liu |
| |
Institution: | 1.School of Mathematics,Shandong University,Jinan,China |
| |
Abstract: | A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper,
it is proved that the (p, 1)-total labelling number of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ(G) ≥ 8p+4 or Δ(G) ≥ 6p+2 and g(G) ≥ 4. As a consequence, the well-known (p, 1)-total labelling conjecture has been confirmed for some 1-planar graphs. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|