The complexity of coloring graphs without long induced paths

Jirí Sgall, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

46 Citations (Scopus)
26 Downloads (Pure)

Fingerprint

Dive into the research topics of 'The complexity of coloring graphs without long induced paths'. Together they form a unique fingerprint.

Business & Economics

Engineering & Materials Science