Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. Filho, H. B. M., Machado, R. C. S., & de Figueiredo, C. M. H. Theor. Comput. Sci., 618:122-134, 2016.
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. [link]Link  Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. [link]Paper  bibtex   
@article{journals/tcs/FilhoMF16,
  added-at = {2016-02-08T00:00:00.000+0100},
  author = {Filho, Hélio B. Macêdo and Machado, Raphael C. S. and de Figueiredo, Celina M. Herrera},
  biburl = {http://www.bibsonomy.org/bibtex/27b5aa7b0ad9d28836ac7819268a08ac2/dblp},
  ee = {http://dx.doi.org/10.1016/j.tcs.2016.01.027},
  interhash = {112436c1bf0448778071d66593b7893b},
  intrahash = {7b5aa7b0ad9d28836ac7819268a08ac2},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  pages = {122-134},
  timestamp = {2016-02-09T11:36:30.000+0100},
  title = {Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs618.html#FilhoMF16},
  volume = 618,
  year = 2016
}
Downloads: 0