An improved linear edge bound for graph linkages
Authors:
- Robin ThomasRTRobin Thomas
- Paul WollanPWPaul Wollan
- 1 April 2005
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 26 (3-4) , 309-324
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Sufficient Degree Conditions for a Graph to be $k$-linkedCombinatorics, Probability and Computing, 2006
- Vertex-Disjoint Cycles Containing Specified EdgesGraphs and Combinatorics, 2000
- Highly linked graphsCombinatorica, 1996
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- An extremal function for contractions of graphsMathematical Proceedings of the Cambridge Philosophical Society, 1984
- 2-Linked GraphsEuropean Journal of Combinatorics, 1980
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- Disjoint paths in graphsDiscrete Mathematics, 1980
- Eine Verallgemeinerung desn-fachen Zusammenhangs f r GraphenMathematische Annalen, 1970
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967