Pages that link to "Item:Q3828026"
From MaRDI portal
The following pages link to Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026):
Displaying 24 items.
- Almost-spanning universality in random graphs (extended abstract) (Q322227) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- Embedding nearly-spanning bounded degree trees (Q950331) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Sparse universal graphs (Q1612288) (← links)
- Sparse multipartite graphs as partition universal for graphs with bounded degree (Q1743481) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Size Ramsey Number of Bounded Degree Graphs for Games (Q2841487) (← links)
- Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ (Q3061179) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)
- On Universal Threshold Graphs (Q4314150) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- An improved upper bound on the density of universal random graphs (Q4982616) (← links)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- On Universal Graphs of Minor Closed Families (Q5300987) (← links)
- Almost‐spanning universality in random graphs (Q5739095) (← links)
- (Q5743497) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- Sparse universal graphs for planarity (Q6085077) (← links)
