Pages that link to "Item:Q1567289"
From MaRDI portal
The following pages link to Embedding trees into graphs of large girth (Q1567289):
Displaying 9 items.
- A randomized embedding algorithm for trees (Q555509) (← links)
- Embedding meshes of trees into deBruijn graphs (Q1199946) (← links)
- Subtrees and subforests of graphs (Q1328385) (← links)
- On graphs which contain each tree of given size (Q1356784) (← links)
- On a conjecture about trees in graphs with large girth (Q1850563) (← links)
- Embedding trees in recursive circulants (Q1923603) (← links)
- Tight bounds for embedding bounded degree trees (Q3060859) (← links)
- A note on the Size-Ramsey number of long subdivisions of graphs (Q4680735) (← links)
- Tree embeddings and tree‐star Ramsey numbers (Q6057900) (← links)