Name
Abstract | ||
|---|---|---|
We prove the conjecture of Seymour (1993) that for every apex-forest $H_1$ and outerplanar graph $H_2$ there is an integer $p$ such that every 2-connected graph of pathwidth at least $p$ contains $H_1$ or $H_2$ as a minor. An independent proof was recently obtained by Dang and Thomas. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s00493-020-3941-3 | arXiv: Combinatorics |
Field | DocType | Volume |
Integer,Discrete mathematics,Graph,Outerplanar graph,Combinatorics,Pathwidth,Conjecture,Mathematics | Journal | abs/1801.01833 |
Issue | Citations | PageRank |
6 | 0 | 0.34 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tony Huynh | 1 | 11 | 9.36 |
| Gwenaël Joret | 2 | 196 | 28.64 |
| piotr micek | 3 | 153 | 27.33 |
| David R. Wood | 4 | 1073 | 96.22 |