L(p,q)-labeling of sparse graphs

Clément Charpentier; Mickaël Montassier; André Raspaud

doi:10.1007/s10878-012-9507-6

Journal Articles Journal of Combinatorial Optimization Year : 2012

L(p,q)-labeling of sparse graphs

(1) , (2, 1) , (1)

1
2

Clément Charpentier

Function : Author
PersonId : 4674
IdHAL : clement-charpentier
IdRef : 184302021

Laboratoire Bordelais de Recherche en Informatique

Mickaël Montassier

Function : Author
PersonId : 7097
IdHAL : mickael-montassier
IdRef : 105605115

Algorithmes, Graphes et Combinatoire

Laboratoire Bordelais de Recherche en Informatique

CV

André Raspaud

Function : Author

Laboratoire Bordelais de Recherche en Informatique

Keywords

Graph theory Graph labeling Graph coloring Sparse graphs

Domains

Discrete Mathematics [cs.DM]

Mickael Montassier : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00738574

Submitted on : Thursday, October 4, 2012-3:51:07 PM

Last modification on : Thursday, February 1, 2024-2:20:20 PM

Dates and versions

lirmm-00738574 , version 1 (04-10-2012)

Identifiers

HAL Id : lirmm-00738574 , version 1
DOI : 10.1007/s10878-012-9507-6

Cite

Clément Charpentier, Mickaël Montassier, André Raspaud. L(p,q)-labeling of sparse graphs. Journal of Combinatorial Optimization, 2012, 25 (4), pp.646-660. ⟨10.1007/s10878-012-9507-6⟩. ⟨lirmm-00738574⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER ANR

140 View

0 Download

L(p,q)-labeling of sparse graphs

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share