Excluding any graph as a minor allows a low tree-width 2-coloring
type: Item
instance of: scholarly article
title: Excluding any graph as a minor allows a low tree-width 2-coloring
zbMATH Open document ID: 1042.05036
author: Matt DeVos
author: Guoli Ding
author: Bogdan Oporowski
author: Daniel P. Sanders
author: Dirk Vertigan
author: Bruce Reed
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 2082029
zbMATH Keywords: Tree-width
zbMATH Keywords: Vertex partitions
zbMATH Keywords: Edge partitions
zbMATH Keywords: Small components
MaRDI profile type: Publication
full work available at URL: j.jctb.2003.09.001
OpenAlex ID: W2037789845
cites work: Graphs with forbidden subgraphs
cites work: Partitioning graphs of bounded tree-width
cites work: Surfaces, tree-width, clique-minors, and partitions
cites work: Graph minors. III. Planar tree-width
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. XVI: Excluding a non-planar graph
cites work: Graph minors. XX: Wagner's conjecture
cites work: Quickly excluding a planar graph
DOI: 10.1016/J.JCTB.2003.09.001
description: scientific article; zbMATH DE number 2082029