Hamiltonian prisms on 5-chordal graphs

Abstract

In this paper, we provide a method to find a Hamiltonian cycle in the prism of a 5-chordal graph, which is $(1+\epsilon )$-tough, with some special conditions.

References in corpus (1)

• Edge-dominating cycles, k-walks and Hamilton prisms in $2K_2$-free graphs