English

M-alternating Hamilton paths and M-alternating Hamilton cycles

Combinatorics 2017-07-25 v1

Abstract

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

Keywords

Cite

@article{arxiv.1707.07291,
  title  = {M-alternating Hamilton paths and M-alternating Hamilton cycles},
  author = {Zan-Bo Zhang and Yueping Li and Dingjun Lou},
  journal= {arXiv preprint arXiv:1707.07291},
  year   = {2017}
}

Comments

published in Discrete Mathematics

R2 v1 2026-06-22T20:55:03.203Z