The following pages link to On embedding graphs in trees (Q1103631):
Displaying 25 items.
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- The treewidth of line graphs (Q723884) (← links)
- On tree congestion of graphs (Q952638) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Embedding meshes of trees into deBruijn graphs (Q1199946) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- On optimal embeddings and trees (Q1668843) (← links)
- Minimal congestion trees (Q1877665) (← links)
- Embedding trees in recursive circulants (Q1923603) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Treewidth, crushing and hyperbolic volume (Q2279065) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Embeddings and other mappings of rooted trees into complete trees (Q2492805) (← links)
- Perfect trees and elementary embeddings (Q3617368) (← links)
- (Q3626172) (← links)
- (Q4027193) (← links)
- Embedding an arbitrary binary tree into the star graph (Q4420948) (← links)
- (Q5089157) (← links)
- (Q5115814) (← links)
- (Q5417728) (← links)
- Optimal arrangement of data in a tree directory (Q5951966) (← links)
