Graph minors. XVII: Taming a vortex.

*(English)*Zbl 1027.05088Summary: 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.

PDF
BibTeX
XML
Cite

\textit{N. Robertson} and \textit{P. D. Seymour}, J. Comb. Theory, Ser. B 77, No. 1, 162--210 (1999; Zbl 1027.05088)

Full Text:
DOI

##### References:

[1] | Robertson, N.; Seymour, P.D., Graph minors. X. obstructions to tree-decomposition, J. combin. theory ser. B, 52, 153-190, (1991) · Zbl 0764.05069 |

[2] | N. Robertson, and, P. D. Seymour, Graph minors. XVI. Excluding a non-planar graph, submitted for publication. · Zbl 1023.05040 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.