Three complexity results on coloring $P_k$-free graphs

Haitze J. Broersma, Vedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)
31 Downloads (Pure)

Fingerprint Dive into the research topics of 'Three complexity results on coloring $P_k$-free graphs'. Together they form a unique fingerprint.

Mathematics