Surface embedding of non-bipartite k-extendable graphs
Abstract
We find the minimum number k=μ'() for any surface , such that every -embeddable non-bipartite graph is not k-extendable. In particular, we construct the so-called bow-tie graphs C6 Pn, and show that they are 3-extendable. This confirms the existence of an infinite number of 3-extendable non-bipartite graphs which can be embedded in the Klein bottle.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.