1 paper · 2 filters
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…