arXiv:1406.1341 [math.CO]AbstractReferencesReviewsResources
Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle
Published 2014-06-05Version 1
The structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus is studied. A general theorem describing the building blocks is presented. These constituents, called hoppers and cascades, are classified for the case when Euler genus is small. As a consequence, the complete list of obstructions of connectivity 2 for embedding graphs into the Klein bottle is obtained.
Related articles: Most relevant | Search more
arXiv:2002.00258 [math.CO] (Published 2020-02-01)
Excluded minors for the Klein Bottle I. Low connectivity case
Note on the Irreducible Triangulations of the Klein Bottle
arXiv:1603.00885 [math.CO] (Published 2016-03-02)
The $K_{n+5}$ and $K_{3^2,1^n}$ families are obstructions to $n$-apex