Hamiltonian cycles with all small even chords
Hamiltonian cycles with all small even chords
复制标题
DOI:
10.1016/j.disc.2011.12.013
复制
发表时间:
2012-03
期刊:
影响因子:
--
通讯作者:
Guantao Chen;K. Ota;Akira Saito;Yi Zhao
中科院分区:
文献类型:
--
作者:
Guantao Chen;K. Ota;Akira Saito;Yi Zhao
Let G be a graph of order n≥3. An even squared Hamiltonian cycle (ESHC) of G is a Hamiltonian cycle C=v1v2…vnv1of G with chords vivi+3for all 1≤i≤n (where vn+j=vjfor j≥1). When n is even, an ESHC contains all bipartite 2-regular graphs of order n. We prove that there is a positive integer N such that for every graph G of even order n≥N, if the minimum degree is δ(G)≥n2+92, then G contains an ESHC. We show that the condition of n being even cannot be dropped and the constant 92 cannot be replaced by 1. Our results can be easily extended to evenkth powered Hamiltonian cycles for all k≥2.