Disjoint Paths—A Survey
- 1 April 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 6 (2) , 300-305
- https://doi.org/10.1137/0606030
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Graph minors. IV. Tree-width and well-quasi-orderingJournal of Combinatorial Theory, Series B, 1990
- Graph minors. VII. Disjoint paths on a surfaceJournal of Combinatorial Theory, Series B, 1988
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. VI. Disjoint paths across a discJournal of Combinatorial Theory, Series B, 1986
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edgesDiscrete Mathematics, 1980
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of the London Mathematical Society, 1952