Graph Minors: XVII. Taming a Vortex

Neil Robertson, P. D. Seymour

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


The main result of this series serves to reduce several problems about general graphs to problems about graphs which can "almost" be drawn in surfaces of bounded genus. In applications of the theorem we usually need to encode such a nearly embedded graph as a hypergraph which can be drawn completely in the surface. The purpose of this paper is to show how to "tidy up" near-embeddings to facilitate the encoding procedure.

Original languageEnglish (US)
Pages (from-to)162-210
Number of pages49
JournalJournal of Combinatorial Theory. Series B
Issue number1
StatePublished - Sep 1999

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Graph Minors: XVII. Taming a Vortex'. Together they form a unique fingerprint.

Cite this