Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the $L(p,1)$-labe ...
Conference paper

On the $L(p,1)$-labelling of graphs

Daniel Gonçalves ORCID (1)
(1) Laboratoire Bordelais de Recherche en Informatique
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Proceedings
DOI
10.46298/dmtcs.3438
License
https://about.hal.science/hal-authorisation-v1
Indicators
591
Views
444
Downloads

On the $L(p,1)$-labelling of graphs

Daniel Gonçalves ORCID (1)
(1) Laboratoire Bordelais de Recherche en Informatique
Abstract
In this paper we improve the best known bound for the $L(p,1)$-labelling of graphs with given maximal degree.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • lambda-labelling
Cited by

Source: OpenCitations

  • -labeling of dually chordal graphs and strongly orderable graphs

    Information Processing Letters

    Authors : B.S. Panda ORCID, Preeti Goel

    Journal reference : Volume 112, 2012, pp. 552-556

    DOI : 10.1016/j.ipl.2012.04.003
  • L(2, 1)-Labeling Halin Graphs with Maximum Degree Eight

    Symmetry

    Authors : Haizhen Qiu, Yushi Che, Yiqiao Wang ORCID

    Journal reference : Volume 15, 2022, pp. 50

    DOI : 10.3390/sym15010050
  • Labelling planar graphs without 4-cycles with a condition on distance two

    Discrete Applied Mathematics

    Authors : Weifan Wang ORCID, Leizhen Cai

    Journal reference : Volume 156, 2007, pp. 2241-2249

    DOI : 10.1016/j.dam.2007.05.061
  • The minimum span of L(2,1)-labelings of certain generalized Petersen graphs

    Discrete Applied Mathematics

    Authors : Sarah Spence Adams ORCID, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland

    Journal reference : Volume 155, 2006, pp. 1314-1325

    DOI : 10.1016/j.dam.2006.12.001
  • n-fold L(2, 1)-labelings of Cartesian product of paths and cycles

    Journal of Combinatorial Optimization

    Authors : Fei-Huang Chang ORCID, Ma-Lian Chia ORCID, Shih-Ang Jiang, David Kuo, Jing-Ho Yan

    Journal reference : Volume 47, 2024, pp.

    DOI : 10.1007/s10878-024-01119-9
Preview
Loading PDF preview...