On the complexity of the selective graph coloring problem in some special classes of graphs. Demange, M.; Monnot, J.; Pop, P. C.; and Ries, B. Theor. Comput. Sci., 540:89-102, 2014.
On the complexity of the selective graph coloring problem in some special classes of graphs. [link]Link  On the complexity of the selective graph coloring problem in some special classes of graphs. [link]Paper  bibtex   
@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}
}
Downloads: 0