Good edge-labelling of graphs

Abstract 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 [J.-C. Bermond, M. Cosnard, and S. Perennes. Directed acyclic graphs with unique path property. Technical Report RR-6932, INRIA, May 2009] 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: C 3 -free outerplanar graphs, planar graphs of girth at least 6, subcubic { C 3 , K 2 , 3 } -free graphs.

[1]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[2]  A characterization of extremal graphs with no matching-cut , 2005 .

[3]  Kavita Bala,et al.  Algorithms for routing in a linear lightwave network , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[4]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[5]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[6]  Paul S. Bonsma,et al.  The complexity of the matching‐cut problem for planar graphs and other graph classes , 2003, J. Graph Theory.

[7]  N. S. Barnett,et al.  Private communication , 1969 .

[8]  Thomas C. Hull,et al.  Defective List Colorings of Planar Graphs , 1997 .

[9]  Paul Bonsma,et al.  Sparse cuts, matching-cuts and leafy trees in graphs , 2006 .

[10]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[11]  Zoltán Füredi,et al.  New Asymptotics for Bipartite Turán Numbers , 1996, J. Comb. Theory, Ser. A.