On the number of hamilton cycles in bounded degree graphs

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 241-248

  Gebauer, Heidi ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

BOUNDED DEGREE GRAPHS; EXTREMAL; HAMILTON CYCLE; IMPROVE-A; LOW BOUND; N-VERTEX GRAPH; NEW APPROACHES; REGULAR GRAPHS; TIME BOUND; UPPER BOUND;

GRAPHIC METHODS;

EID: 58349105980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972986.8     Document Type: Conference Paper

References (5)

1. K. Buchin, C. Knauer, K. Kriegel, A. Schulz, and R. Seidel, On the Number of Cycles in Planar Graphs, 13th Annual International Computing and Combinatorics Conference, Proc. COCOON 2007, to appear
2. D. Eppstein, The Traveling Salesman Problem for Cubic Graphs, Lecture Notes in Computer Science, Volume 2748, Sep 2003, 307-318
3. H. Gebauer, The full version of On the Number of Hamilton Cycles in Bounded Degree Graphs, http://people.inf.ethz.ch/gebauerh/
4. K. Iwama and T. Nakashima, An Improved Exact Algorithm for Cubic Graph TSP, 13th Annual International Computing and Combinatorics Conference, Proc. COCOON 2007, to appear
5. M.Sharir and E.Welzl, On the number of crossing-free matchings, (cycles, and partitions), Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, 860-869