An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence

Prantik Biswas, Chumki Acharya, Nirupam Chakrabarti, Shreyasi Das, Abhisek Paul, Paritosh Bhattacharya. An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence. In Indu Nair, Sushmita Mitra, Ljiljana Trajkovic, Punam Bedi, Suzanne McIntosh, M. S. Rajasree, editors, Proceedings of the Third International Symposium on Women in Computing and Informatics, WCI 2015, co-located with ICACCI 2015, Kochi, India, August 10-13, 2015. pages 458-462, ACM, 2015. [doi]

@inproceedings{BiswasACDPB15,
  title = {An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence},
  author = {Prantik Biswas and Chumki Acharya and Nirupam Chakrabarti and Shreyasi Das and Abhisek Paul and Paritosh Bhattacharya},
  year = {2015},
  doi = {10.1145/2791405.2791539},
  url = {http://doi.acm.org/10.1145/2791405.2791539},
  researchr = {https://researchr.org/publication/BiswasACDPB15},
  cites = {0},
  citedby = {0},
  pages = {458-462},
  booktitle = {Proceedings of the Third International Symposium on Women in Computing and Informatics, WCI 2015, co-located with ICACCI 2015, Kochi, India, August 10-13, 2015},
  editor = {Indu Nair and Sushmita Mitra and Ljiljana Trajkovic and Punam Bedi and Suzanne McIntosh and M. S. Rajasree},
  publisher = {ACM},
  isbn = {978-1-4503-3361-0},
}