Graph Theory 6-3: Tree Decompositions and Tree Width

preview_player
Показать описание
In the third video of Week 6, we introduce tree decompositions and tree-width, two important concepts in Structural Graph Theory.
Рекомендации по теме
Комментарии
Автор

Question: does the last part imply that the k-coloring problem has FPT algorithm of running time O(k^tw)?

newbie