Universality for Graphs of Bounded Degeneracy
Authors:
Open Access
- 11 March 2026
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 68 (2) , e70055
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council
This publication has 21 references indexed in Scilit:
- Universal and unavoidable graphsCombinatorics, Probability and Computing, 2021
- Spanning universality in random graphsRandom Structures & Algorithms, 2018
- Almost‐spanning universality in random graphsRandom Structures & Algorithms, 2016
- Factors in random graphsRandom Structures & Algorithms, 2008
- Sparse universal graphs for bounded‐degree graphsRandom Structures & Algorithms, 2006
- Small Universal Graphs for Bounded-Degree Planar GraphsCombinatorica, 2002
- Sparse universal graphsJournal of Computational and Applied Mathematics, 2002
- Expanding graphs contain all small treesCombinatorica, 1987
- Uniform data encodingsTheoretical Computer Science, 1980
- On graphs which contain all small treesJournal of Combinatorial Theory, Series B, 1978