Graph Minors I: A Short Proof of the Path-width Theorem
type: Item
instance of: scholarly article
title: Graph Minors I: A Short Proof of the Path-width Theorem
zbMATH Open document ID: 0829.05039
DOI: 10.1017/S0963548300001450
author: Reinhard Diestel
published in: Combinatorics, Probability and Computing
publication date: 1996-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 790734
zbMATH Keywords: path-width theorem
zbMATH Keywords: forest
zbMATH Keywords: minor
MaRDI profile type: Publication
cites work: Graph minors. I. Excluding a forest
cites work: Quickly excluding a forest
full work available at URL: s0963548300001450
OpenAlex ID: W2088373372
Recommended article: Graph minors. II. Algorithmic aspects of tree-width
Recommended article: Q3656223
Recommended article: Graph minors. III. Planar tree-width
Recommended article: Q3684139
Recommended article: Graph minors. XIII: The disjoint paths problem
Recommended article: Towards the Graph Minor Theorems for Directed Graphs
Recommended article: Minors in graphs of large \(\theta_r\)-girth
Recommended article: Graph minors. IV: Tree-width and well-quasi-ordering
Recommended article: A shorter proof of the graph minor algorithm: the unique linkage theorem
description: scientific article; zbMATH DE number 790734