Counting perfect matchings in n-extendable graphs

DOI10.1016/J.DISC.2006.08.011zbMATH Open1168.05315OpenAlexW1987936039MaRDI QIDQ2483418FDOQ2483418

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

Recommendations

• scientific article; zbMATH DE number 1833087
• Matching connectivity: on the structure of graphs with perfect matchings
• Extremal graphs with a given number of perfect matchings
• A new lower bound on the number of perfect matchings in cubic graphs
• scientific article; zbMATH DE number 786151

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

• Matching theory
• The complexity of computing the permanent
• On n-extendable graphs
• Extending matchings in graphs: A survey
• Title not available (Why is that?)
• Fullerene graphs with exponentially many perfect matchings
• Independence number in \(n\)-extendable graphs
• Title not available (Why is that?)

Cited In (6)

• Counting matchings in graphs
• Title not available (Why is that?)
• On the upper bounds of the numbers of perfect matchings in graphs with given parameters
• On counting perfect matchings in general graphs
• How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483418)