Hamiltonian prisms on 5-chordal graphs

2016/03/04 by Gao Mou, Gao, Mou
Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1603.01371

openalex publication_date 2016/03/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Citations

• Tough graphs and hamiltonian circuits

Related

• 10-tough chordal graphs are Hamiltonian
• Toughness and prism-hamiltonicity of P₄-free graphs
• Hamiltonian cycles in 7-tough (P₄∪ P₁)-free graphs
• Hamiltonian cycles in tough (P₄ ∪ P₁)-free graphs
• Hamilton cycles in tough (2P₂ ∪ P₁)-free graphs