On a Problem of Ore
John W. Moon · The Mathematical Gazette · 1965
A graph consists of a set of vertices some pairs of which are joined by a single edge . A path is a sequence of distinct vertices (x 1 , x 2 , …, x m ) such that consecutive vertices x i and x i+1 are joined by an edge (x i , x i+1 ) , for i = 1, 2, .., m — 1. One of the unsolved problems of graph theory is to obtain criteria for determining whether any given graph has a Hamilton path , i.e., a path which passes through each vertex exactly once. (For pertinent references and further definitions, see [1].)