Showing cs.DMShow all
4 papers · 1 filter
cs.DM2021
The 1-1 algorithm for Travelling Salesman Problem
Heping Jiang
The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilton cycle in a graph, is a typical problem in operation research and combinatorial optimization. In this pape…
cs.DM2019
The induced subgraph K_2_,_3 in a non-Hamiltonian graphs
Heping Jiang
A graph is a tuple , where is the vertex set, is the edge set. A reduced graph is a graph of deleting non-Hamiltoni…
cs.DM2019
Non-Hamilton cycle sets of having solutions and their properties
Heping Jiang
A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges…
cs.DM2018
A note on the Grinberg condition in the cycle spaces
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…