Surface embedding of non-bipartite -extendable graphs
arXiv:1501.05398
Abstract
We find the minimum number for any surface , such that every -embeddable non-bipartite graph is not -extendable. In particular, we construct the so-called bow-tie graphs , and show that they are -extendable. This confirms the existence of an infinite number of -extendable non-bipartite graphs which can be embedded in the Klein bottle.
17 pages, 5 figures