%0 Journal Article %1 journals/mst/StraubTW16 %A Straub, Simon %A Thierauf, Thomas %A Wagner, Fabian %D 2016 %J Theory Comput. Syst. %K %N 3 %P 416-439 %T Counting the Number of Perfect Matchings in K 5-Free Graphs. %U http://dblp.uni-trier.de/db/journals/mst/mst59.html#StraubTW16 %V 59

@article{journals/mst/StraubTW16, added-at = {2023-12-13T01:40:28.000+0100}, author = {Straub, Simon and Thierauf, Thomas and Wagner, Fabian}, biburl = {https://www.bibsonomy.org/bibtex/24bc2a933757f7556479dda660a41180b/admin}, ee = {http://dx.doi.org/10.1007/s00224-015-9645-1}, interhash = {74cc1498c5c13c86186bea58fd607ae2}, intrahash = {4bc2a933757f7556479dda660a41180b}, journal = {Theory Comput. Syst.}, keywords = {}, number = 3, pages = {416-439}, timestamp = {2023-12-13T01:40:28.000+0100}, title = {Counting the Number of Perfect Matchings in K 5-Free Graphs.}, url = {http://dblp.uni-trier.de/db/journals/mst/mst59.html#StraubTW16}, volume = 59, year = 2016 }