Embedding nearly-spanning bounded degree trees
- 1 November 2007
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 27 (6) , 629-644
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Random Graphs2001
- The Probabilistic Method2000
- On the second eigenvalue and random walks in randomd-regular graphsCombinatorica, 1991
- Universal Graphs for Bounded-Degree Trees and Planar GraphsSIAM Journal on Discrete Mathematics, 1989
- Trees in sparse random graphsJournal of Combinatorial Theory, Series B, 1988
- On Universal Graphs for Spanning TreesJournal of the London Mathematical Society, 1983
- Long paths in sparse random graphsCombinatorica, 1982
- The longest path in a random graphCombinatorica, 1981
- ON UNIVERSAL GRAPHSAnnals of the New York Academy of Sciences, 1979
- On graphs which contain all small treesJournal of Combinatorial Theory, Series B, 1978