Hajo Broersma, Fedor V. Fomin, Pim van t Hof, Daniël Paulusma. Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. In Christophe Paul, Michel Habib, editors, Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Volume 5911 of Lecture Notes in Computer Science, pages 44-53, 2009. [doi]
@inproceedings{BroersmaFHP09,
title = {Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs},
author = {Hajo Broersma and Fedor V. Fomin and Pim van t Hof and Daniël Paulusma},
year = {2009},
doi = {10.1007/978-3-642-11409-0_4},
url = {http://dx.doi.org/10.1007/978-3-642-11409-0_4},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BroersmaFHP09},
cites = {0},
citedby = {0},
pages = {44-53},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
editor = {Christophe Paul and Michel Habib},
volume = {5911},
series = {Lecture Notes in Computer Science},
isbn = {978-3-642-11408-3},
}