English

Surface embedding of non-bipartite $k$-extendable graphs

Combinatorics 2015-01-23 v1

Abstract

We find the minimum number k=μ(Σ)k=\mu'(\Sigma) for any surface Σ\Sigma, such that every Σ\Sigma-embeddable non-bipartite graph is not kk-extendable. In particular, we construct the so-called bow-tie graphs C6PnC_6\bowtie P_n, and show that they are 33-extendable. This confirms the existence of an infinite number of 33-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

R2 v1 2026-06-22T08:09:22.372Z