Narrowing Down the Gap on the Complexity of Coloring ::::P::::::::::k::::::-Free Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song. Narrowing Down the Gap on the Complexity of Coloring ::::P::::::::::k::::::-Free Graphs. In Dimitrios M. Thilikos, editor, Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers. Volume 6410 of Lecture Notes in Computer Science, pages 63-74, 2010. [doi]

This author has not been identified. Look up 'Hajo Broersma' in GoogleThis author has not been identified. Look up 'Petr A. Golovach' in GoogleThis author has not been identified. Look up 'Daniël Paulusma' in GoogleThis author has not been identified. Look up 'Jian Song' in Google

runs on WebDSL