Counting perfect matchings in \(n\)-extendable graphs

DOI10.1016/j.disc.2006.08.011zbMath1168.05315OpenAlexW1987936039MaRDI QIDQ2483418

Tomislav Došlić

Publication date: 28 April 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.08.011

zbMATH Keywords

enumerationperfect matching\(n\)-extendable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Fullerene graphs with exponentially many perfect matchings
• Matching theory
• On n-extendable graphs
• Extending matchings in graphs: A survey
• Independence number in \(n\)-extendable graphs

This page was built for publication: Counting perfect matchings in \(n\)-extendable graphs