15 citations · 16 across the 8 of their papers we have counts for
1 paper · 2 filters
Heping Jiang
Deciding if a graph is a Hamilton graph, also named the Hamilton cycle problem, is important for discrete mathematics and computer science. Due to no characterization to identify H…