A Lower Bound of the cd-Chromatic Number and Its Complexity

M. A. Shalu, S. Vijayakumar, T. P. Sandhya. A Lower Bound of the cd-Chromatic Number and Its Complexity. In Daya Ram Gaur, N. S. Narayanaswamy, editors, Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings. Volume 10156 of Lecture Notes in Computer Science, pages 344-355, Springer, 2017. [doi]

@inproceedings{ShaluVS17,
  title = {A Lower Bound of the cd-Chromatic Number and Its Complexity},
  author = {M. A. Shalu and S. Vijayakumar and T. P. Sandhya},
  year = {2017},
  doi = {10.1007/978-3-319-53007-9_30},
  url = {http://dx.doi.org/10.1007/978-3-319-53007-9_30},
  researchr = {https://researchr.org/publication/ShaluVS17},
  cites = {0},
  citedby = {0},
  pages = {344-355},
  booktitle = {Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings},
  editor = {Daya Ram Gaur and N. S. Narayanaswamy},
  volume = {10156},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-53006-2},
}