Old Web
English
Sign In
Acemap
>
Paper
>
Counting the Number of Perfect Matchings in K 5 -free Graphs.
Counting the Number of Perfect Matchings in K 5 -free Graphs.
2014
Simon Straub
Thomas Thierauf
Fabian Wagner
Keywords:
Discrete mathematics
Combinatorics
Mathematics
Tutte theorem
Chordal graph
Indifference graph
Strong perfect graph theorem
Graph
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]