On 4-Regular Planar Hamiltonian Graphs
In order to research knots with large crossing numbers, one would like to be able to select a random knot from the set of all knots with n crossings with as close to uniform probability as possible. The underlying graph of a knot diagram can be viewed as a 4-regular planar graph. The existence of...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
TopSCHOLAR®
2006
|
| Subjects: | |
| Online Access: | http://digitalcommons.wku.edu/theses/277 http://digitalcommons.wku.edu/cgi/viewcontent.cgi?article=1280&context=theses |