Between Proper and Strong Edge-Colorings of Subcubic Graphs

Hervé Hocquard, Dimitri Lajou, Borut Luzar. Between Proper and Strong Edge-Colorings of Subcubic Graphs. In Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, editors, Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. Volume 12126 of Lecture Notes in Computer Science, pages 355-367, Springer, 2020. [doi]

@inproceedings{HocquardLL20,
  title = {Between Proper and Strong Edge-Colorings of Subcubic Graphs},
  author = {Hervé Hocquard and Dimitri Lajou and Borut Luzar},
  year = {2020},
  doi = {10.1007/978-3-030-48966-3_27},
  url = {https://doi.org/10.1007/978-3-030-48966-3_27},
  researchr = {https://researchr.org/publication/HocquardLL20},
  cites = {0},
  citedby = {0},
  pages = {355-367},
  booktitle = {Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings},
  editor = {Leszek Gasieniec and Ralf Klasing and Tomasz Radzik},
  volume = {12126},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-48966-3},
}