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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.