Surface embedding of non-bipartite $k$-extendable graphs
Combinatorics
2015-01-23 v1
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.
Keywords
Cite
@article{arxiv.1501.05398,
title = {Surface embedding of non-bipartite $k$-extendable graphs},
author = {Hongliang Lu and David G. L. Wang},
journal= {arXiv preprint arXiv:1501.05398},
year = {2015}
}
Comments
17 pages, 5 figures