J4 ›› 2013, Vol. 48 ›› Issue (4): 28-34.

• Articles • Previous Articles     Next Articles

On L(p,q)-labeling of planar graphs without 4,5,6-cycles and intersecting triangles

ZHU Hai-yang1, CHEN Wei1, L Xin-zhong2, LI Pei-jun3   

  1. 1. Department of Flight Support, Air Force Logistical College, Xuzhou 221000, Jiangsu, China;
    2. College of Mathematics, Physics and Information Engineering, Zhejiang Normal University,
    Jinhua 321004, Zhejiang, China;
    3.Department of Airport Engineering, Air Force Logistical College, Xuzhou 221000, Jiangsu, China
  • Received:2011-05-08 Online:2013-04-20 Published:2013-04-16

Abstract:

Let λp,q(G) denote the L(p,q)-labeling number of a planar graph G. It is showed that if G be a planar graphs without 4,5,6-cycles and intersecting triangles, then λp,q(G)≤(2q-1)Δ(G)+max{4p+4q-4, 6p+2q-4, 8p-4}. This result imply that Wagner’s conjecture holds for a planar graph G without 4,5,6-cycles and intersecting triangles.

Key words: L(p,q)-labeling; planar graph; cycles

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!