On Universal Graphs for Spanning Trees
From MaRDI portal
Publication:4748169
DOI10.1112/jlms/s2-27.2.203zbMath0509.05033OpenAlexW1997949020WikidataQ56504573 ScholiaQ56504573MaRDI QIDQ4748169
Ronald L. Graham, Fan R. K. Chung
Publication date: 1983
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-27.2.203
Related Items
Universal and unavoidable graphs, Induced-universal graphs for graphs with bounded maximum degree, On Universal Graphs of Minor Closed Families, Almost-spanning universality in random graphs (extended abstract), Objective functions with redundant domains, Explicit construction of linear sized tolerant networks, Adjacency Labeling Schemes and Induced-Universal Graphs, On unavoidable graphs, Supertrees, Panarboreal graphs, Sparse universal graphs for planarity, Induced subgraphs of zero-divisor graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Sparse multipartite graphs as partition universal for graphs with bounded degree, Embedding nearly-spanning bounded degree trees, Expanders Are Universal for the Class of All Spanning Trees, Almost‐spanning universality in random graphs, On induced-universal graphs for the class of bounded-degree graphs, Explicit construction of linear sized tolerant networks. (Reprint), Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$, Universality of random graphs and rainbow embedding, Optimal threshold for a random graph to be 2-universal, Unnamed Item, Distance realization problems with applications to internet tomography
