An Chang
Abstract
Based on the two theorems of Hamilton paths and Hamilton cycles,generalized and got a new sufficient condition for a graph to be Hamiltonian.It is shown that the well-known Ore's theorem follows directly from the result.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on the two theorems of Hamilton paths and Hamilton cycles,generalized and got a new sufficient condition for a graph to be Hamiltonian.It is shown that the well-known Ore's theorem follows directly from the result.
Key concepts: Hamiltonian path, Mathematics, Hamiltonian (control theory), Combinatorics, Graph, Discrete mathematics, Mathematical optimization