The following pages link to On embedding graphs in trees (Q1103631):
Displaying 10 items.
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- The treewidth of line graphs (Q723884) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Minimal congestion trees (Q1877665) (← 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)
- (Q5089157) (← links)
- (Q5115814) (← links)
