Proofs for Hamilton Graph and Hadwiger's Conjecture

Hong Yang
Department of Computer Center, Guangdong Nanhai Architecture Design Institute,
Foshan 528200
P.R.China

Abstract    
The sufficient and necessary condition of Hamilton graph hasn't been found so far. In this paper, some characteristics of a kind of subgraph may be used to find it; an indeterminate equation is obtained and its solution may be used to find two special subgraph. Then the Hamilton cycle exists if and only if the two subgraphs exist. The existing cycle can be found easily.
Finally, we go into the Hadwiger conjecture. Some interesting conclusions may be found.