Name
Abstract | ||
|---|---|---|
Fix g>1. Every graph of large enough tree-width contains a g×g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g×g grid as an immersion (and hence contains any fixed graph with maximum degree at most four as an immersion). This result has a number of applications. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jctb.2015.07.006 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Graph immersion,Grid minors | Discrete mathematics,Graph,Combinatorics,Immersion (virtual reality),Degree (graph theory),Mathematics,Grid | Journal |
Volume | Issue | ISSN |
116 | C | 0095-8956 |
Citations | PageRank | References |
4 | 0.46 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Chudnovsky | 1 | 390 | 46.13 |
| Zdenek Dvorak | 2 | 104 | 16.60 |
| Tereza Klimosova | 3 | 18 | 6.12 |
| Paul D. Seymour | 4 | 2786 | 314.49 |