Universal Graphs for Bounded-Degree Trees and Planar Graphs
From MaRDI portal
Publication:3828026
DOI10.1137/0402014zbMath0674.05037DBLPjournals/siamdm/BhattCLR89OpenAlexW2052690504WikidataQ56504574 ScholiaQ56504574MaRDI QIDQ3828026
Sandeep N. Bhatt, Arnold L. Rosenberg, Frank Thompson Leighton, Fan R. K. Chung
Publication date: 1989
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0402014
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (24)
Universal and unavoidable graphs ⋮ Induced-universal graphs for graphs with bounded maximum degree ⋮ On Universal Graphs of Minor Closed Families ⋮ An approach to emulating separable graphs ⋮ Almost-spanning universality in random graphs (extended abstract) ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ On Universal Threshold Graphs ⋮ Sparse universal graphs for planarity ⋮ 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 ⋮ A randomized embedding algorithm for trees ⋮ Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs ⋮ Routing multiple paths in hypercubes ⋮ Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ ⋮ Universality of random graphs and rainbow embedding ⋮ An improved upper bound on the density of universal random graphs ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ Unnamed Item ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ Sparse universal graphs
This page was built for publication: Universal Graphs for Bounded-Degree Trees and Planar Graphs
