Eppstein, David. "The traveling salesman problem for cubic graphs.." Journal of Graph Algorithms and Applications 11.1 (2007): 61-81. <http://eudml.org/doc/55409>.
@article{Eppstein2007, author = {Eppstein, David}, journal = {Journal of Graph Algorithms and Applications}, keywords = {minimum weight Hamiltonian cycle}, language = {eng}, number = {1}, pages = {61-81}, publisher = {Brown University, Providence, RI; University of Texas, Dallas}, title = {The traveling salesman problem for cubic graphs.}, url = {http://eudml.org/doc/55409}, volume = {11}, year = {2007}, }
TY - JOUR AU - Eppstein, David TI - The traveling salesman problem for cubic graphs. JO - Journal of Graph Algorithms and Applications PY - 2007 PB - Brown University, Providence, RI; University of Texas, Dallas VL - 11 IS - 1 SP - 61 EP - 81 LA - eng KW - minimum weight Hamiltonian cycle UR - http://eudml.org/doc/55409 ER -
