{"version.version":"0.0.7","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-533/paper-7.html","spt.description":null,"spt.id":"Vol-533/paper-7","spt.wikidataid":null,"spt.title":"A complete algorithm to solve the graph-coloring problem","spt.pdfUrl":"https://ceur-ws.org/Vol-533/09_LANMR09_06.pdf","spt.volume":{"number":533,"acronym":"LANMR'09","wikidataid":"Q113545581","title":"LANMR'09 Latin American Workshop on Non-Monotonic Reasoning 2009","description":"Proceedings of I-USED 2009 workshop","url":"http://ceur-ws.org/Vol-533/","date":"2009-11-06","dblp":"conf/lanmr/2009","k10plus":null,"urn":"urn:nbn:de:0074-533-8"},"spt.session":null,"cvb.id":"Vol-533/paper-7","cvb.title":"A complete algorithm to solve the graph-coloring problem","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"","cvb.vol_number":"533","cvb.pdf_name":"09_LANMR09_06.pdf","cvb.pages":null,"cvb.fail":null,"dblp.dblp_publication_id":"https://dblp.org/rec/conf/lanmr/AyaneguiC09","dblp.dblp_proceeding_id":"https://dblp.org/rec/conf/lanmr/2009","dblp.volume_number":533,"dblp.title":"A complete algorithm to solve the graph-coloring problem.","dblp.authors":[{"dblp_author_id":"https://dblp.org/pid/04/4187","label":"Alberto Chávez-Aragón","wikidata_id":null,"orcid_id":null,"gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/61/2872","label":"Huberto Ayanegui-Santiago","wikidata_id":null,"orcid_id":null,"gnd_id":null}],"dblp.pdf_id":"Vol-533/09_LANMR09_06"}