Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs.

Gebauer, Heidi. "Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P132, 28 p., electronic only-Research Paper P132, 28 p., electronic only. <http://eudml.org/doc/224902>.

@article{Gebauer2011,
author = {Gebauer, Heidi},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {enumeration; maximum number; Hamilton cycles; partial Hamilton cycles; algorithm},
language = {eng},
number = {1},
pages = {Research Paper P132, 28 p., electronic only-Research Paper P132, 28 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs.},
url = {http://eudml.org/doc/224902},
volume = {18},
year = {2011},
}

TY - JOUR
AU - Gebauer, Heidi
TI - Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P132, 28 p., electronic only
EP - Research Paper P132, 28 p., electronic only
LA - eng
KW - enumeration; maximum number; Hamilton cycles; partial Hamilton cycles; algorithm
UR - http://eudml.org/doc/224902
ER -