On Universal Graphs for Spanning Trees
From MaRDI portal
Cited in
(31)- Explicit construction of linear sized tolerant networks
- Panarboreal graphs
- Distance realization problems with applications to internet tomography
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Supertrees
- Objective functions with redundant domains
- Explicit construction of linear sized tolerant networks. (Reprint)
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Universality of random graphs and rainbow embedding
- Explicit sparse almost-universal graphs for G (n, kn)
- Almost-spanning universality in random graphs (extended abstract)
- Adjacency labeling schemes and induced-universal graphs
- Expanders Are Universal for the Class of All Spanning Trees
- Optimal threshold for a random graph to be 2-universal
- On universal graphs of minor closed families
- Almost-spanning universality in random graphs
- Expanders are universal for the class of all spanning trees
- Universal and unavoidable graphs
- On unavoidable graphs
- Sparse universal graphs for planarity
- Induced subgraphs of zero-divisor graphs
- Universal geometric graphs
- Super graphs on groups. II
- A note on universal graphs for spanning trees
- Universality for graphs with bounded density
- Unique subgraphs are rare
- Universality for graphs of bounded degeneracy
- Subgraph-universal planar graphs for trees
- Induced-universal graphs for graphs with bounded maximum degree
- Embedding nearly-spanning bounded degree trees
- On induced-universal graphs for the class of bounded-degree graphs
This page was built for publication: On Universal Graphs for Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4748169)
