A simple application of the Minor Structure Theorem showing the existence of low-treewidth colorings. We also discuss algorithmic aspects of such colorings and other related graph decompositions.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Low-Treewidth Colorings

  • Zdeněk Dvořák

摘要

A simple application of the Minor Structure Theorem showing the existence of low-treewidth colorings. We also discuss algorithmic aspects of such colorings and other related graph decompositions.