Graphs whose maximum spanning Eulerian subgrahs are Hamilton cycles;

In this paper,the sufficient conditions are given out that C_n~m can be factorized into Hamilton cycles and G~(2m) has m edge-disjoint Hamilton cycles.

Authors discuss the Hamiltonian property of Cartesiam product (C_n)×(C_m) about two directed cycles (C_n)and(C_m), give and show that: (C_n)×(C_m) has a directed Hamilton path,but not has generally a directed Hamilton cycle.

On the belief that Hamilton circle determines Hamilton graph,the paper suggests a transformation method to locate Hamilton circle in the graph,ie.

Minimal Hamilton circle, which can be applied to solving problem of street vender s load, wants for an effective method of solving so far.

Hamiltonian cycles in cubelike recursive networks;

The problem of edge-disjoint Hamiltonian cycles was widely concerned in theory and application.

Some formulas for calculating the number of all distinct Hamiltonian cycles in some simple graphs are provided and upper(resp.

Hamilton paths in Z-transformation graphs of polyomino graphs

Though considering the in-degree sequence of T-i, for every i∈{1,2,:,s}, this paper gives a lower bound of the number of Hamilton path for tournament T.

Authors discuss the Hamiltonian property of Cartesiam product (C_n)×(C_m) about two directed cycles (C_n)and(C_m), give and show that: (C_n)×(C_m) has a directed Hamilton path,but not has generally a directed Hamilton cycle.