Algorithms and Bounds for Very Strong Rainbow Coloring

L. Sunil Chandran, Anita Das 0003, Davis Issac, Erik Jan van Leeuwen. Algorithms and Bounds for Very Strong Rainbow Coloring. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 625-639, Springer, 2018. [doi]

@inproceedings{Chandran0IL18,
  title = {Algorithms and Bounds for Very Strong Rainbow Coloring},
  author = {L. Sunil Chandran and Anita Das 0003 and Davis Issac and Erik Jan van Leeuwen},
  year = {2018},
  doi = {10.1007/978-3-319-77404-6_46},
  url = {https://doi.org/10.1007/978-3-319-77404-6_46},
  researchr = {https://researchr.org/publication/Chandran0IL18},
  cites = {0},
  citedby = {0},
  pages = {625-639},
  booktitle = {LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
  editor = {Michael A. Bender and Martin Farach-Colton and Miguel A. Mosteiro},
  volume = {10807},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-77404-6},
}