List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs Algorithmica | 2017-04-12 | Paper |
| Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 Theoretical Computer Science | 2016-02-18 | Paper |
| Biclique-colouring verification complexity and biclique-colouring power graphs Discrete Applied Mathematics | 2015-08-18 | Paper |
| Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 Lecture Notes in Computer Science | 2014-03-31 | Paper |
| Clique-colouring and biclique-colouring unichord-free graphs LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Research outcomes over time
This page was built for person: Hélio B. Macêdo Filho
