Algorithms for Finding Distance-Edge-Colorings of Graphs

Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki. Algorithms for Finding Distance-Edge-Colorings of Graphs. In Lusheng Wang, editor, Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings. Volume 3595 of Lecture Notes in Computer Science, pages 798-807, Springer, 2005. [doi]

@inproceedings{ItoKZN05,
  title = {Algorithms for Finding Distance-Edge-Colorings of Graphs},
  author = {Takehiro Ito and Akira Kato and Xiao Zhou and Takao Nishizeki},
  year = {2005},
  doi = {10.1007/11533719_81},
  url = {http://dx.doi.org/10.1007/11533719_81},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ItoKZN05},
  cites = {0},
  citedby = {0},
  pages = {798-807},
  booktitle = {Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings},
  editor = {Lusheng Wang},
  volume = {3595},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-28061-8},
}