On counting perfect matchings in general graphs
From MaRDI portal
Publication:2294743
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Approximation algorithms (68W25)
Recommendations
- Counting perfect matchings in \(n\)-extendable graphs
- scientific article; zbMATH DE number 5952364
- Counting matchings in graphs
- The enumeration of perfect matchings in two types of graphs
- scientific article; zbMATH DE number 15371
- Counting formulas of perfect matchings of two types of graphs
- Perfect matchings and derangements on graphs
- The number of perfect matchings of two types of particular graphs
- A determinant-based algorithm for counting perfect matchings in a general graph
- On the upper bounds of the numbers of perfect matchings in graphs with given parameters
Cited in
(25)- On the random generation and counting of matchings in dense graphs
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
- Approximating the permanent of graphs with large factors
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
- Counting the number of perfect matchings, and generalized decision trees
- Scaling matrices and counting the perfect matchings in graphs
- Zero-freeness and approximation of real Boolean Holant problems
- The mixing time of switch Markov chains: a unified approach
- The enumeration of perfect matchings in two types of graphs
- scientific article; zbMATH DE number 5952364 (Why is no real title available?)
- scientific article; zbMATH DE number 1962833 (Why is no real title available?)
- Parity separation: a scientifically proven method for permanent weight loss
- Counting matchings with k unmatched vertices in planar graphs
- Counting weighted independent sets beyond the permanent
- The Perfect Matching Reconfiguration Problem
- Approximate counting of matchings in sparse uniform hypergraphs
- Counting perfect matchings and the switch chain
- scientific article; zbMATH DE number 5196300 (Why is no real title available?)
- A determinant-based algorithm for counting perfect matchings in a general graph
- Counting perfect matchings as fast as Ryser
- Counting matchings in graphs
- Counting the number of matchings in chordal and chordal bipartite graph classes
- Perfect matchings, rank of connection tensors and graph homomorphisms
- Degree-preserving graph dynamics: a versatile process to construct random networks
- On the upper bounds of the numbers of perfect matchings in graphs with given parameters
This page was built for publication: On counting perfect matchings in general graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294743)
