1. Berthe, G., Martin, B., Paulusma, D., Smith, S.: The complexity of l(p, q)-edge-labelling. CoRR abs/2008.12226 (2020). https://arxiv.org/abs/2008.12226
2. Lecture Notes in Computer Science;J Bok,2021
3. Bok, J., Jedlic̆ková, N., Martin, B., Paulusma, D., Smith, S.: Acyclic, star and injective colouring: a complexity picture for H-free graphs. In: Proceedings of ESA 2020, LIPIcs, vol. 173, pp. 22:1–22:22 (2020)
4. Lecture Notes in Computer Science;C Brause,2021
5. Calamoneri, T.: The $${L}(h, k)$$-labelling problem: an updated survey and annotated bibliography. Comput. J. 54, 1344–1371 (2011)