Small spectral gap in the combinatorial laplacian implies hamiltonian

Annals of Combinatorics

Volumn 13, Issue 4, 2010, Pages 403-412

  Butler, Steve ^a   Chung, Fan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Combinatorial Laplacian; Hamiltonian; Spectral graph theory

Indexed keywords

EID: 75549087109     PISSN: 02180006     EISSN: 02193094     Source Type: Journal    
DOI: 10.1007/s00026-009-0039-4     Document Type: Article

References (11)

1. Alon N., Spencer J. H.: The Probabilistic Method, 2nd Ed. Wiley, New York (2000).
2. Applegate D., Bixby R., Chvátal V., Cook W.: On the solution of traveling salesman problems. Doc. Math. 3, 645-656 (1998).
3. Chang H.-W., Hwang F. K., Lee J. S.: The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9, 398-423 (1993).
4. Chung, F.: Discrete isoperimetric inequalities. In: Surveys in Differential Geometry, vol. IX, pp. 53-82. International Press, Somerville (2004).
5. Dirac G. A.: Hamiltonian circuits and long circuits. Ann. Discrete Math. 3, 75-92 (1978).
6. Held M., Karp R. M.: The traveling-salesman problem and minimum spanning trees. Operation Res. 18, 1138-1162 (1970).
7. Karp R. M.: Reduciblity among combinatorial problems. In: Miller, R. E., Thatcher, J. W. (eds) Comoplexity of Computer Computations, pp. 85-103. Plenum, New York (1972).
8. Komlós, J., Szemerédi, E.: Hamilton cycles in random graphs. In: Infinite and finite sets, vol. II, pp. 1003-1010. North-Holland, Amsterdam (1975).
9. Krivelevich M., Sudakov B.: Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42, 17-33 (2003).
10. Pósa L.: Hamiltonian circuits in random graphs. Discrete Math. 14, 359-364 (1976).
11. Woeginger, G. J.: Exact algorithms for NP-hard problems: a survey. In: Combinatorial Optimization-Eureka, You shrink!, pp. 185-207. Springer, New York (2003).