An Algorithm to Generate 4-Regular Planar Hamiltonian Graphs
In this paper, the problem of randomly generating 4-regular planar Hamiltonian graphs is discussed and a solution is described. An algorithm which efficiently generates the graphs in linear time and in a near-uniform manner is given. In addition, a formula is provided that determines the total numbe...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
TopSCHOLAR®
2006
|
| Subjects: | |
| Online Access: | http://digitalcommons.wku.edu/theses/440 http://digitalcommons.wku.edu/cgi/viewcontent.cgi?article=1443&context=theses |