Combinatorics and Graph Theory

    

Threeconnected Graphs with Only One Hamiltonian Circuit

Authors: Dainis Zeps, Emanuels Grinbergs

We will call graph 1-H-graph if it is threeconnected and it has only one Hamiltonian circuit

Comments: 6 pages

Download: PDF

Submission history

[v1] 22 Jan 2010

Add your own feedback and questions here: