Universal Graphs for Bounded-Degree Trees and Planar Graphs
From MaRDI portal
Recommendations
Cited in
(38)- On universal graphs for planar oriented graphs of a given girth
- Sparse universal graphs
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Universality of random graphs and rainbow embedding
- Size Ramsey number of bounded degree graphs for games
- Explicit sparse almost-universal graphs for G (n, kn)
- Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
- Almost-spanning universality in random graphs (extended abstract)
- Routing multiple paths in hypercubes
- Universal graphs and induced-universal graphs
- scientific article; zbMATH DE number 1247777 (Why is no real title available?)
- scientific article; zbMATH DE number 1305403 (Why is no real title available?)
- An approach to emulating separable graphs
- On Universal Threshold Graphs
- Adjacency labeling schemes and induced-universal graphs
- Expanders Are Universal for the Class of All Spanning Trees
- An improved upper bound on the density of universal random graphs
- A universality theorem for stressable graphs in the plane
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
- Optimal threshold for a random graph to be 2-universal
- The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
- On universal graphs of minor closed families
- Bandwidth, treewidth, separators, expansion, and universality
- Sparse universal graphs for bounded‐degree graphs
- A randomized embedding algorithm for trees
- Almost-spanning universality in random graphs
- Expanders are universal for the class of all spanning trees
- Universal and unavoidable graphs
- Sparse universal graphs for planarity
- Universal geometric graphs
- A note on universal graphs for spanning trees
- Universality for graphs of bounded degeneracy
- Size-Ramsey numbers of structurally sparse graphs
- Induced-universal graphs for graphs with bounded maximum degree
- Universal graphs with a forbidden subtree
- Embedding nearly-spanning bounded degree trees
- On induced-universal graphs for the class of bounded-degree graphs
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
This page was built for publication: Universal Graphs for Bounded-Degree Trees and Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3828026)
