Good edge-labelling of graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Good edge-labelling of graphs


A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one (u, v)-path with non-decreasing labels. This notion was introduced in [3] to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at characterizing the class of graphs that admit a good edge-labelling. First, we exhibit infinite families of graphs for which no such edge-labelling can be found. We then show that deciding if a graph admits a good edge-labelling is NP-complete. Finally, we give large classes of graphs admitting a good edge-labelling: C3-free outerplanar graphs, planar graphs of girth at least 6, subcubic {C3,K2,3}-free graphs.
Fichier principal
Vignette du fichier
ext-goodlab.pdf (110.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00749194 , version 1 (12-12-2012)



Julio Araujo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs. LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. pp.275-280, ⟨10.1016/j.endm.2009.11.045⟩. ⟨hal-00749194⟩
215 View
161 Download



Gmail Facebook Twitter LinkedIn More