Cubic bridgeless graphs have more than a linear number of perfect matchings

DOI10.1016/j.endm.2009.07.068zbMath1273.05170OpenAlexW2003777791WikidataQ57601457 ScholiaQ57601457MaRDI QIDQ2851496

František Kardoš, Louis Esperet, Daniel Král'

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.068

zbMATH Keywords

cubic graphsperfect matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Brick decompositions and the matching rank of graphs
• Matching theory
• Counting 1-factors in regular bipartite graphs
• Perfect matchings in planar cubic graphs
• Rank of maximum matchings in a graph
• Unnamed Item

This page was built for publication: Cubic bridgeless graphs have more than a linear number of perfect matchings