%0 Conference Paper %1 conf/walcom/BertheMPS22 %A Berthe, Gaétan %A Martin, Barnaby %A Paulusma, Daniël %A Smith, Siani %B WALCOM %D 2022 %E Mutzel, Petra %E Rahman, Md. Saidur %E Slamin, %I Springer %K dblp %P 175-186 %T The Complexity of L(p, q)-Edge-Labelling. %U http://dblp.uni-trier.de/db/conf/walcom/walcom2022.html#BertheMPS22 %V 13174 %@ 978-3-030-96731-4

@inproceedings{conf/walcom/BertheMPS22, added-at = {2023-11-12T00:00:00.000+0100}, author = {Berthe, Gaétan and Martin, Barnaby and Paulusma, Daniël and Smith, Siani}, biburl = {https://www.bibsonomy.org/bibtex/2ded7c9fcf52d4c127a78e111d7befd22/dblp}, booktitle = {WALCOM}, crossref = {conf/walcom/2022}, editor = {Mutzel, Petra and Rahman, Md. Saidur and Slamin}, ee = {https://doi.org/10.1007/978-3-030-96731-4_15}, interhash = {f5d00e47554f1df8c7effd6fce54fb77}, intrahash = {ded7c9fcf52d4c127a78e111d7befd22}, isbn = {978-3-030-96731-4}, keywords = {dblp}, pages = {175-186}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T11:27:49.000+0200}, title = {The Complexity of L(p, q)-Edge-Labelling.}, url = {http://dblp.uni-trier.de/db/conf/walcom/walcom2022.html#BertheMPS22}, volume = 13174, year = 2022 }