Graph minors. XXI. Graphs with unique linkages
Authors:
- Neil RobertsonNRNeil Robertson
- Paul SeymourPSPaul Seymour
- 1 May 2009
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 99 (3) , 583-616
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Graph Minors. XX. Wagner's conjectureJournal of Combinatorial Theory, Series B, 2004
- Graph Minors. XVI. Excluding a non-planar graphJournal of Combinatorial Theory, Series B, 2003
- Graph MinorsJournal of Combinatorial Theory, Series B, 1999
- Graph Minors .XII. Distance on a SurfaceJournal of Combinatorial Theory, Series B, 1995
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Quickly Excluding a Planar GraphJournal of Combinatorial Theory, Series B, 1994
- Graph minors. X. Obstructions to tree-decompositionJournal of Combinatorial Theory, Series B, 1991
- A menger-like property of tree-width: The finite caseJournal of Combinatorial Theory, Series B, 1990
- Graph minors. VII. Disjoint paths on a surfaceJournal of Combinatorial Theory, Series B, 1988
- Dissections and Intertwinings of GraphsThe American Mathematical Monthly, 1978