Good edge-labelling of graphs. - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2012

Good edge-labelling of graphs.

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

Abstract

A good edge-labelling of a graph G is a labelling of its edges such that, for any ordered pair of vertices (x, y), there do not exist two paths from x to y with increasing labels. This notion was introduced in [2] 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 G admits a good edge-labelling is NPcomplete, even if G is bipartite. Finally, we give large classes of graphs admitting a good edge-labelling: C3-free outerplanar graphs, planar graphs of girth at least 6, {C3,K2,3}-free subcubic graphs and {C3,K2,3}-free ABC-graphs.
Fichier principal
Vignette du fichier
goodlab03-with-final-modifs.pdf (251.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00639005 , version 1 (07-11-2011)

Identifiers

Cite

Julio Araujo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs.. Discrete Applied Mathematics, 2012, V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009, 160 (18), pp.2502-2513. ⟨10.1016/j.dam.2011.07.021⟩. ⟨inria-00639005⟩
140 View
129 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More