M-alternating Hamilton paths and M-alternating Hamilton cycles
Abstract
We study -alternating Hamilton paths and -alternating Hamilton cycles in a simple connected graph on vertices with a perfect matching . Let be a bipartite graph, we prove that if for any two vertices and in different parts of , , then has an -alternating Hamilton cycle. For general graphs, a condition for the existence of an -alternating Hamilton path starting and ending with edges in is put forward. Then we prove that if , where denotes the connectivity of , then has an -alternating Hamilton cycle or belongs to one class of exceptional graphs. Lou and Yu \cite{LY} have proved that every -extendable graph with is bipartite or satisfies . Combining this result with those we obtain we prove the existence of -alternating Hamilton cycles in .
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