Fast exact algorithms for hamiltonicity in claw-free graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5911 LNCS, Issue , 2010, Pages 44-53

  Broersma, Hajo ^a   Fomin, Fedor V ^b   Van 'T Hof, Pim ^a   Paulusma, Daniël ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATED GRAPH; CLAW-FREE GRAPHS; EULERIAN; EXACT ALGORITHMS; HAMILTONIAN CYCLE; HAMILTONICITY; N-VERTEX GRAPH; NP COMPLETE PROBLEMS; OPEN PROBLEMS; POLYNOMIAL SPACE; SUBGRAPHS;

ALGORITHMS; COMPUTER SCIENCE; EQUIVALENCE CLASSES; HAMILTONIANS;

GRAPH THEORY;

EID: 72249100433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11409-0_4     Document Type: Conference Paper

References (19)

1. Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters 47, 203-207 (1993)
2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 198-209. Springer, Heidelberg (2008)
3. Broersma, H.J., Paulusma, D.: Computing sharp 2-factors in claw-free graphs. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 193-204. Springer, Heidelberg (2008)
4. Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2000)
5. Eppstein, D.: The traveling salesman problem for cubic graphs. Journal of Graph Algorithms and Applications 11, 61-81 (2007)
6. Faudree, R., Flandrin, E., Ryjáček, Z.: Claw-free graphs-a survey. Discrete Mathematics 164, 87-147 (1997)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)
8. Gebauer, H.: On the number of hamilton cycles in bounded degree graphs. In: 4th Workshop on Analytic and Combinatorics (ANALCO 2008), SIAM, Philadelphia (2008)
9. Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)
10. Harary, F., Nash-Williams, C.S.J.A.: On eulerian and hamiltonian graphs and line graphs. Canadian Mathematical Bulletin 8, 701-709 (1965)
11. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM 10, 196-210 (1962)
12. Iwama, K., Nakashima, T.: An improved exact algorithm for cubic graph TSP. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 108-117. Springer, Heidelberg (2007)
13. Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Operations Research Letters 1, 49-51 (1982)
14. Li, M., Corneil, D.G., Mendelsohn, E.: Pancyclicity and NP-completeness in planar graphs. Discrete Applied Mathematics 98, 219-225 (2000)
15. Müller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics 156, 291-298 (1996)
16. Roussopoulos, N.D.: A max {m,n} algorithm for determining the graph H from its line graph G. Information Processing Letters 2, 108-112 (1973)
17. Ryjáček, Z.: On a closure concept in claw-free graphs. Journal of Combinatorial Theory, series B 70, 217-224 (1997)
18. Thomassen, C., Toft, B.: Non-separating induced cycles in graphs. Journal of Combinatorial Theory, Series B 31, 199-224 (1981)
19. Woeginger, G.J.: Open problems around exact algorithms. Discrete Applied Mathematics 156, 397-405 (2008)