Title

Excluding any graph as a minor allows a low tree-width 2-coloring

Document Type

Article

Publication Date

1-1-2004

Abstract

This article proves the conjecture of Thomas that, for every graph G, there is an integer k such that every graph with no minor isomorphic to G has a 2-coloring of either its vertices or its edges where each color induces a graph of tree-width at most k. Some generalizations are also proved. © 2003 Elsevier Inc. All rights reserved.

Publication Source (Journal or Book title)

Journal of Combinatorial Theory. Series B

First Page

25

Last Page

41

This document is currently not available here.

Share

COinS