Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle
Combinatorics
2014-06-06 v1
Abstract
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.
Cite
@article{arxiv.1406.1341,
title = {Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle},
author = {Bojan Mohar and Petr Škoda},
journal= {arXiv preprint arXiv:1406.1341},
year = {2014}
}
Comments
45 pages