Advertisement

Journal of Combinatorial Optimization

, Volume 25, Issue 4, pp 646–660 | Cite as

L(p,q)-labeling of sparse graphs

  • Clément Charpentier
  • Mickaël Montassier
  • André Raspaud
Article

Abstract

Let p and q be positive integers. An L(p,q)-labeling of a graph G with a span s is a labeling of its vertices by integers between 0 and s such that adjacent vertices of G are labeled using colors at least p apart, and vertices having a common neighbor are labeled using colors at least q apart. We denote by λ p,q (G) the least integer k such that G has an L(p,q)-labeling with span k.

The maximum average degree of a graph G, denoted by \(\operatorname {Mad}(G)\), is the maximum among the average degrees of its subgraphs (i.e. \(\operatorname {Mad}(G) = \max\{\frac{2|E(H)|}{|V(H)|} ; H \subseteq G \}\)). We consider graphs G with \(\operatorname {Mad}(G) < \frac{10}{3}\), 3 and \(\frac{14}{5}\). These sets of graphs contain planar graphs with girth 5, 6 and 7 respectively.

We prove in this paper that every graph G with maximum average degree m and maximum degree Δ has:
  • λ p,q (G)≤(2q−1)Δ+6p+10q−8 if \(m < \frac{10}{3}\) and p≥2q.

  • λ p,q (G)≤(2q−1)Δ+4p+14q−9 if \(m < \frac{10}{3}\) and 2q>p.

  • λ p,q (G)≤(2q−1)Δ+4p+6q−5 if m<3.

  • λ p,q (G)≤(2q−1)Δ+4p+4q−4 if \(m < \frac{14}{5}\).

We give also some refined bounds for specific values of p, q, or Δ. By the way we improve results of Lih and Wang (SIAM J. Discrete Math. 17(2):264–275, 2003).

Keywords

Graph theory Graph labeling Graph coloring Sparse graphs 

Notes

Acknowledgements

The authors are grateful to the referees for their careful reading and their helpful comments.

References

  1. Calamoneri T (2006) The L(h,k)-labeling problem: a survey and an annotated bibliography. Comput J 49:585–608 CrossRefGoogle Scholar
  2. Chang GJ, Kuo D (1996) The L(2,1)-labeling problem on graphs. SIAM J Discrete Math 9:309–316 MathSciNetCrossRefMATHGoogle Scholar
  3. Charpentier C, Montassier M, Raspaud A (2012) L(p,q)-labeling of sparse graphs. Technical report, LaBRI Google Scholar
  4. Gonçalves D (2005) On the L(p,1)-labelling of graphs. Discrete Math 308:1405–1414 CrossRefGoogle Scholar
  5. Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance 2. SIAM J Discrete Math 5:586–595 MathSciNetCrossRefMATHGoogle Scholar
  6. Jensen TR, Toft B (1995) Choosability versus chromaticity. Geocombinatorics 5:45–64 MathSciNetMATHGoogle Scholar
  7. Kramer F, Kramer H (1969) Un problème de coloration des sommets d’un graphe. C R Acad Sci Paris A 268:46–48 MATHGoogle Scholar
  8. Kramer F, Kramer H (2008) A survey on the distance coloring of graphs. Discrete Math 308:422–426 MathSciNetCrossRefMATHGoogle Scholar
  9. Lih K-W, Wang W-F (2003) Labeling planar graphs with conditions on girth and distance two. SIAM J Discrete Math 17(2):264–275 MathSciNetCrossRefMATHGoogle Scholar
  10. Lih K-W, Wang W-F (2006) Coloring the squares of an outerplanar graph. Taiwan J Math 10(4):1015–1023 MathSciNetMATHGoogle Scholar
  11. Wegner G (1977) Graphs with given diameter and a colouring problem. Technical report, University of Dortmund Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Clément Charpentier
    • 1
  • Mickaël Montassier
    • 1
  • André Raspaud
    • 1
  1. 1.LaBRIUniversité de BordeauxTalence cedexFrance

Personalised recommendations