A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
From MaRDI portal
Publication:3583319
DOI10.1137/080723843zbMath1207.05157WikidataQ57601447 ScholiaQ57601447MaRDI QIDQ3583319
Jean-Sébastien Sereni, Daniel Král', Michael Stiebitz
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080723843
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs, Randomly colouring graphs (a combinatorial view), Exponentially many perfect matchings in cubic graphs, 1-factor covers of regular graphs, An improved linear bound on the number of perfect matchings in cubic graphs, On essentially 4-edge-connected cubic bricks