Maximum degree in minor-closed classes of graphs
Authors:
- Omer GiménezOGOmer Giménez
- Dieter MitscheDMDieter Mitsche
- Marc NoyMNMarc Noy
- 1 July 2016
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 55, 41-61
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The maximum degree of random planar graphsProceedings of the London Mathematical Society, 2014
- Graph classes with given 3‐connected components: Asymptotic enumeration and random graphsRandom Structures & Algorithms, 2012
- Simply generated trees, conditioned Galton–Watson trees, random allocations and condensationProbability Surveys, 2012
- Degree distribution in random planar graphsJournal of Combinatorial Theory, Series A, 2011
- The Maximum Degree of Series-Parallel GraphsCombinatorics, Probability and Computing, 2011
- Random Graphs with Few Disjoint CyclesCombinatorics, Probability and Computing, 2011
- The Degree Sequence of Random Graphs from Subcritical ClassesCombinatorics, Probability and Computing, 2009
- Random Graphs from a Minor-Closed ClassCombinatorics, Probability and Computing, 2009
- The Distribution of the Maximum Vertex Degree in Random Planar MapsJournal of Combinatorial Theory, Series A, 2000
- The maximum degree in a random tree and related problemsRandom Structures & Algorithms, 1994