Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
