The Complexity of L(p, q)-Edge-Labelling

Gaetan Berthe, Barnaby Martin, Daniƫl Paulusma, Siani Smith. The Complexity of L(p, q)-Edge-Labelling. In Petra Mutzel, Md. Saidur Rahman, Slamin, editors, WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings. Volume 13174 of Lecture Notes in Computer Science, pages 175-186, Springer, 2022. [doi]

Abstract

Abstract is missing.