@article{ journals/tcs/DemangeMPR14,
  added-at = {2014-09-26T00:00:00.000+0200},
  author = {Demange, Marc and Monnot, Jérôme and Pop, Petrica C. and Ries, Bernard},
  biburl = {http://www.bibsonomy.org/bibtex/20ec192e3fabf47663a7df869b50947a1/dblp},
  ee = {http://dx.doi.org/10.1016/j.tcs.2013.04.018},
  interhash = {4b5cef9dcd58493143d463a99ed4a691},
  intrahash = {0ec192e3fabf47663a7df869b50947a1},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  pages = {89-102},
  title = {On the complexity of the selective graph coloring problem in some special classes of graphs.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs540.html#DemangeMPR14},
  volume = {540},
  year = {2014}
}

{"_id":"zSozGaDk8EMj4Bos4","bibbaseid":"demange-monnot-pop-ries-onthecomplexityoftheselectivegraphcoloringprobleminsomespecialclassesofgraphs-2014","downloads":0,"creationDate":"2015-05-07T12:05:13.483Z","title":"On the complexity of the selective graph coloring problem in some special classes of graphs.","author_short":["Demange, M.","Monnot, J.","Pop, P.<nbsp>C.","Ries, B."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/bernard?items=1000","bibdata":{"added-at":"2014-09-26T00:00:00.000+0200","author":["Demange, Marc","Monnot, Jérôme","Pop, Petrica C.","Ries, Bernard"],"author_short":["Demange, M.","Monnot, J.","Pop, P.<nbsp>C.","Ries, B."],"bibtex":"@article{ journals/tcs/DemangeMPR14,\n added-at = {2014-09-26T00:00:00.000+0200},\n author = {Demange, Marc and Monnot, Jérôme and Pop, Petrica C. and Ries, Bernard},\n biburl = {http://www.bibsonomy.org/bibtex/20ec192e3fabf47663a7df869b50947a1/dblp},\n ee = {http://dx.doi.org/10.1016/j.tcs.2013.04.018},\n interhash = {4b5cef9dcd58493143d463a99ed4a691},\n intrahash = {0ec192e3fabf47663a7df869b50947a1},\n journal = {Theor. Comput. Sci.},\n keywords = {dblp},\n pages = {89-102},\n title = {On the complexity of the selective graph coloring problem in some special classes of graphs.},\n url = {http://dblp.uni-trier.de/db/journals/tcs/tcs540.html#DemangeMPR14},\n volume = {540},\n year = {2014}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/20ec192e3fabf47663a7df869b50947a1/dblp","ee":"http://dx.doi.org/10.1016/j.tcs.2013.04.018","id":"journals/tcs/DemangeMPR14","interhash":"4b5cef9dcd58493143d463a99ed4a691","intrahash":"0ec192e3fabf47663a7df869b50947a1","journal":"Theor. Comput. Sci.","key":"journals/tcs/DemangeMPR14","keywords":"dblp","pages":"89-102","title":"On the complexity of the selective graph coloring problem in some special classes of graphs.","type":"article","url":"http://dblp.uni-trier.de/db/journals/tcs/tcs540.html#DemangeMPR14","volume":"540","year":"2014","bibbaseid":"demange-monnot-pop-ries-onthecomplexityoftheselectivegraphcoloringprobleminsomespecialclassesofgraphs-2014","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.tcs.2013.04.018","Paper":"http://dblp.uni-trier.de/db/journals/tcs/tcs540.html#DemangeMPR14"},"keyword":["dblp"],"downloads":0},"search_terms":["complexity","selective","graph","coloring","problem","special","classes","graphs","demange","monnot","pop","ries"],"keywords":["dblp"],"authorIDs":[],"dataSources":["wvAhRjakvxMweG8ZA"]}