Abstract
We prove that a graph does not contain as a minor a graph formed by 0-, 1-, 2- or 3-summing k copies of K5 or K3,3, if and only if it has bounded genus.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 323-353 |
| Number of pages | 31 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 178 |
| DOIs | |
| State | Published - May 2026 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Keywords
- Bounded genus
- Graph minors
Fingerprint
Dive into the research topics of 'Excluding sums of Kuratowski graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver