Extremal Functions for Graph Linkages and Rooted Minors
Extremal Functions for Graph Linkages and Rooted Minors Paul Wollan 137 pages Directed by: Robin Thomas A graph G is k-linked if for any 2k distinct vertices s_1,..., s_k,t_1,..., t_k there exist k vertex disjoint paths P_1,...,P_k such that the endpoints of P_i are s_i and t_i. Determining t...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/7552 |