A complete algorithm to solve the graph-coloring problem

Huberto Ayanegui, Alberto Chávez-Aragón. A complete algorithm to solve the graph-coloring problem. In Mauricio Osorio, Claudia Zepeda, Ivan Olmos, Carolina Medina, José Arrazola, editors, Proceedings of the Fifth Latin American Workshop on Non-Monotonic Reasoning 2009 (LANMR'09) , Facultad de Ciencias Básicas, Ingeniería y Tecnología , Universidad Autónoma de Tlaxcala (UAT) , Apizaco, Tlaxcala, México, November 5-6, 2009. Volume 533 of CEUR Workshop Proceedings, pages 107-129, CEUR-WS.org, 2009. [doi]

@inproceedings{AyaneguiC09,
  title = {A complete algorithm to solve the graph-coloring problem},
  author = {Huberto Ayanegui and Alberto Chávez-Aragón},
  year = {2009},
  url = {http://ceur-ws.org/Vol-533/09_LANMR09_06.pdf},
  researchr = {https://researchr.org/publication/AyaneguiC09},
  cites = {0},
  citedby = {0},
  pages = {107-129},
  booktitle = {Proceedings of the Fifth Latin American Workshop on Non-Monotonic Reasoning 2009 (LANMR'09) , Facultad de Ciencias Básicas, Ingeniería y Tecnología , Universidad Autónoma de Tlaxcala (UAT) , Apizaco, Tlaxcala, México, November 5-6, 2009},
  editor = {Mauricio Osorio and Claudia Zepeda and Ivan Olmos and Carolina Medina and José Arrazola},
  volume = {533},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}