Excluding sums of Kuratowski graphs

Research output: Contribution to journalArticlepeer-review

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 languageEnglish (US)
JournalJournal of Combinatorial Theory. Series B
DOIs
StateAccepted/In press - 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