Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

George B. Mertzios, Paul G. Spirakis. Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. In Peter van Emde Boas, Frans C. A. Groen, Giuseppe F. Italiano, Jerzy R. Nawrocki, Harald Sack, editors, SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings. Volume 7741 of Lecture Notes in Computer Science, pages 332-343, Springer, 2013. [doi]

@inproceedings{MertziosS13,
  title = {Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs},
  author = {George B. Mertzios and Paul G. Spirakis},
  year = {2013},
  doi = {10.1007/978-3-642-35843-2_29},
  url = {http://dx.doi.org/10.1007/978-3-642-35843-2_29},
  researchr = {https://researchr.org/publication/MertziosS13},
  cites = {0},
  citedby = {0},
  pages = {332-343},
  booktitle = {SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings},
  editor = {Peter van Emde Boas and Frans C. A. Groen and Giuseppe F. Italiano and Jerzy R. Nawrocki and Harald Sack},
  volume = {7741},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-35843-2},
}