Pages that link to "Item:Q3060859"
From MaRDI portal
The following pages link to Tight bounds for embedding bounded degree trees (Q3060859):
Displaying 13 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- Degree constrained tree embedding into points in the plane (Q1208443) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- (Q4370210) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
- Degree Conditions for Embedding Trees (Q5232383) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Embedding loose spanning trees in 3-uniform hypergraphs (Q6564604) (← links)
