Counting the Number of Perfect Matchings in K 5-Free Graphs
Crossref DOI link: https://doi.org/10.1007/s00224-015-9645-1
Published Online: 2015-07-15
Published Print: 2016-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Straub, Simon
Thierauf, Thomas
Wagner, Fabian
Text and Data Mining valid from 2015-07-15
