Random graphs containing few disjoint excluded minors
- 27 July 2012
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 44 (2) , 240-268
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Random Graphs with Few Disjoint CyclesCombinatorics, Probability and Computing, 2011
- Random unlabelled graphs containing few disjoint cyclesRandom Structures & Algorithms, 2010
- Growth constants of minor-closed classes of graphsJournal of Combinatorial Theory, Series B, 2010
- Small graph classes and bounded expansionJournal of Combinatorial Theory, Series B, 2010
- Analytic Combinatorics2009
- Random graphs on surfacesJournal of Combinatorial Theory, Series B, 2008
- The Erdős–Pósa Property For Long CircuitsCombinatorica, 2007
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Homomorphies tze f r GraphenMathematische Annalen, 1968
- On Independent Circuits Contained in a GraphCanadian Journal of Mathematics, 1965