Highly connected sets and the excluded grid theorem
From MaRDI portal
Publication:1306423
DOI10.1006/jctb.1998.1862zbMath0949.05075MaRDI QIDQ1306423
Reinhard Diestel, Carsten Thomassen, Tommy R. Jensen, Konstantin Yu. Gorbunov
Publication date: 29 November 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1862
05C83: Graph minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- On a complexity of the formula \((A\bigvee B) \Rightarrow C\)
- Quickly excluding a planar graph
- A simpler proof of the excluded minor theorem for higher surfaces
- Graph minors. IV: Tree-width and well-quasi-ordering