Excluding any graph as a minor allows a low tree-width 2-coloring.
Matt DeVosGuoli DingBogdan OporowskiDaniel P. SandersBruce A. ReedPaul D. SeymourDirk VertiganPublished in: J. Comb. Theory, Ser. B (2004)
Keyphrases
- tree width
- tree decomposition
- structural properties
- constraint networks
- shortest path
- exact and approximate
- conjunctive queries
- decomposition method
- graph theory
- computationally challenging
- constraint satisfaction problems
- parallel processing
- special case
- probabilistic reasoning
- relational structures
- decomposition methods
- probabilistic model