Graph minors. V. Excluding a planar graph
Authors:
- Neil RobertsonNRNeil Robertson
- P.D SeymourPSP.D Seymour
- 1 August 1986
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 41 (1) , 92-114
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- A homology theory for spanning tress of a graphActa Mathematica Hungarica, 1977
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- On Independent Circuits Contained in a GraphCanadian Journal of Mathematics, 1965
- From Matrices to GraphsCanadian Journal of Mathematics, 1964
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961