A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.

Louis Esperet Frantisek Kardos Daniel Král'

Published in: Eur. J. Comb. (2012)

Keyphrases

small number
upper bound
similarity measure
support vector
computational complexity
data structure
pattern recognition