Reference Request : 3-regular graphs are not uniquely hamiltonian.

97 Views Asked by At

I have found the following articles which relates somewhat to what I am searching for but completely so I need help finding more references, if not similar to what I have then anything closely related to it.

  1. Planar Graphs, Regular Graphs, Bipartite Graphs and Hamiltonicity :

  2. Hamiltonicity of planar cubic multigraphs

  3. A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three

1

There are 1 best solutions below

0
On BEST ANSWER

W. T. Tutte “on Hamiltonian circuits”. J. London Math. Soc. (1946). This contains a proof that in a cubic graph the number of Hamiltonian circuits on an edge is even.