Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3

Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. Herrera de Figueiredo. Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. Theoretical Computer Science, 618:122-134, 2016. [doi]

Authors

Hélio B. Macêdo Filho

This author has not been identified. Look up 'Hélio B. Macêdo Filho' in Google

Raphael C. S. Machado

This author has not been identified. Look up 'Raphael C. S. Machado' in Google

Celina M. Herrera de Figueiredo

This author has not been identified. Look up 'Celina M. Herrera de Figueiredo' in Google