Surface embedding of non-bipartite kk-extendable graphs

preprint2015arXivOpen access

Abstract

We find the minimum number k=μ′(Σ)k=μ'(Σ) for any surface ΣΣ, such that every ΣΣ-embeddable non-bipartite graph is not kk-extendable. In particular, we construct the so-called bow-tie graphs C6⋈PnC_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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.