On the expected number of perfect matchings in cubic planar graphs.

Marc Noy Clément Requilé Juanjo Rué

Published in: CoRR (2020)

Keyphrases

computational complexity
upper bound
planar graphs