an:01464277
Zbl 1027.05088
Robertson, Neil; Seymour, P. D.
Graph minors. XVII: Taming a vortex
EN
J. Comb. Theory, Ser. B 77, No. 1, 162-210 (1999).
00058982
1999
j
05C83 05C10
genus; embedded graph; surface
Summary: 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.
Reviewer (Berlin)