Searching for "The complexity of coloring graphs without long induced paths." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

The Complexity of Coloring Graphs Without Long Induced Paths
by Gerhard Woeginger Ji, Ji R I Sgall — Acta Cybernetica
…The complexity of coloring graphs without long induced paths Gerhard J. Woeginger Ji r' i Sgall…
Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB