Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor

Zdenek Dvorák, Abhiruk Lahiri. Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. In Daniël Paulusma, Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Volume 14093 of Lecture Notes in Computer Science, pages 291-304, Springer, 2023. [doi]

@inproceedings{DvorakL23,
  title = {Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor},
  author = {Zdenek Dvorák and Abhiruk Lahiri},
  year = {2023},
  doi = {10.1007/978-3-031-43380-1_21},
  url = {https://doi.org/10.1007/978-3-031-43380-1_21},
  researchr = {https://researchr.org/publication/DvorakL23},
  cites = {0},
  citedby = {0},
  pages = {291-304},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers},
  editor = {Daniël Paulusma and Bernard Ries},
  volume = {14093},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-43380-1},
}