15 citations · 16 across the 8 of their papers we have counts for
8 papers
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…
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…
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…
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…
A '1+1' Algorithm for the Hamilton Cycle Problem
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…
Solutions of Grinberg equation and removable cycles in a cycle basis
Heping Jiang
Let G (V, E) be a simple graph with vertex set V and edge set E. A generalized cycle is a subgraph such that any vertex degree is even. A simple cycle (briefly in a cycle) is a con…
A New Property of Hamilton Graphs
Heping Jiang
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient…
Non-Hamiltonian Holes in Grid Graphs
Heping Jiang
In this paper we extend general grid graphs to the grid graphs consist of polygons tiling on a plane, named polygonal grid graphs. With a cycle basis satisfied polygons tiling, we…