College best publication award for ‘Hamilton decompositions of regular expanders: a proof of Kelly’s conjecture for large tournaments’ (Advances in Mathemtics 237 (2013), 62-146) Graphs are very ...

This project classifies images of graphs to determine if they are Hamiltonian graphs. A Hamiltonian graph contains a Hamiltonian cycle (a cycle that visits every vertex once and returns to the ...

Abstract: In this paper, many ordinary graphs are subjected to Hamilton graph discrimination by using some necessary conditions and sufficient conditions proposed by many researchers in the past, and ...

Abstract: Non-Hamiltonian graph is featured by the degree sequence that fails to meet the Chvátal condition. By analyzing this feature, a new function of the edge bound for non-Hamiltonian graph is ...