- Email: [email protected]
On Minimal Non-Hamiltonian Locally Hamiltonian Graphs
Annals of Discrete Mathematics 9 (1980) 265 @ North-Holland Publishing Company.
ON MINIMAL NON-HAMILTOMAN LOCALLY HAMILTONIAN GRAPHS
C.M.PAREEK and Z. SKUPIEN Uniwrsity of Waterloo, Waterloo, Ontario, NZL 3G1, Canada
Abstract A graph G = (X, E) is called Harniltonian if it has a Hamiltonian circuit, i.e. a circuit whose set of vertices is the vertex set X of G. G is called locally Hamiltonian if for every x in X the graph exists and is Hamiltonian. In this note, we show that a minimal non-Hamiltonian, connected locally Hamiltonian graph is of order eleven.
265
ON MINIMAL NON-HAMILTOMAN LOCALLY HAMILTONIAN GRAPHS
C.M.PAREEK and Z. SKUPIEN Uniwrsity of Waterloo, Waterloo, Ontario, NZL 3G1, Canada
Abstract A graph G = (X, E) is called Harniltonian if it has a Hamiltonian circuit, i.e. a circuit whose set of vertices is the vertex set X of G. G is called locally Hamiltonian if for every x in X the graph exists and is Hamiltonian. In this note, we show that a minimal non-Hamiltonian, connected locally Hamiltonian graph is of order eleven.
265