pith. sign in

arxiv: 1707.07291 · v1 · pith:77YNVHP3new · submitted 2017-07-23 · 🧮 math.CO

M-alternating Hamilton paths and M-alternating Hamilton cycles

classification 🧮 math.CO
keywords hamiltonalternatingcyclesgraphkappaprovethenbipartite
0
0 comments X
read the original abstract

We study $M$-alternating Hamilton paths and $M$-alternating Hamilton cycles in a simple connected graph $G$ on $\nu$ vertices with a perfect matching $M$. Let $G$ be a bipartite graph, we prove that if for any two vertices $x$ and $y$ in different parts of $G$, $d(x)+d(y)\geq \nu/2+2$, then $G$ has an $M$-alternating Hamilton cycle. For general graphs, a condition for the existence of an $M$-alternating Hamilton path starting and ending with edges in $M$ is put forward. Then we prove that if $\kappa(G)\geq\nu/2$, where $\kappa(G)$ denotes the connectivity of $G$, then $G$ has an $M$-alternating Hamilton cycle or belongs to one class of exceptional graphs. Lou and Yu \cite{LY} have proved that every $k$-extendable graph $H$ with $k\geq\nu/4$ is bipartite or satisfies $\kappa(H)\geq 2k$. Combining this result with those we obtain we prove the existence of $M$-alternating Hamilton cycles in $H$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.