The number of perfect matchings of two types of particular graphs
From MaRDI portal
Publication:3132368
DOI10.3785/J.ISSN.1008-9497.2017.03.003zbMATH Open1389.05136MaRDI QIDQ3132368FDOQ3132368
Authors: Baoxiang Tang, Han Ren 
Publication date: 29 January 2018
Recommendations
- Counting formulas for the number of perfect matchings of three types of graphs
- The number of perfect matchings in three types of graphs
- The number of perfect matchings in four types of particular graphs
- The counting formula of the perfect matchings of three types of special graphs
- The analytic formula of the number of perfect matchings of two types of graphs
Cited In (18)
- Title not available (Why is that?)
- The number of perfect matchings in three types of graphs
- The number of perfect matchings in six types of graphs
- An infinite family of graphs with a facile count of perfect matchings
- Perfect matchings in edge-transitive graphs
- Counting the number of matchings in chordal and chordal bipartite graph classes
- The enumeration of perfect matchings in two types of graphs
- Title not available (Why is that?)
- The number of perfect matchings in five types of graphs
- Enumeration of perfect matchings in some type polyominoes
- Counting formulas of perfect matchings of two types of graphs
- Counting formulas for the number of perfect matchings of three types of graphs
- The counting formula of the perfect matchings of three types of special graphs
- Recurrence calculation of the perfect matchings number of two types of graphs
- On counting perfect matchings in general graphs
- The analytic formula of the number of perfect matchings of two types of graphs
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
- The number of perfect matchings in four types of particular graphs
This page was built for publication: The number of perfect matchings of two types of particular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132368)
