15 citations · 16 across the 8 of their papers we have counts for
1 paper · 1 filter
Heping Jiang
Finding a Hamilton graph from simple connected graphs is an important problem in discrete mathematics and computer science. Grinberg Theorem is a well-known necessary condition for…