scientific article; zbMATH DE number 5952364

zbMATH Open1240.05245MaRDI QIDQ3170050FDOQ3170050

Authors: Baoxiang Tang, Han Ren 

Publication date: 29 September 2011

Title of this publication is not available (Why is that?)

Recommendations

• The number of perfect matchings of two types of particular graphs
• The number of perfect matchings in three types of graphs
• The number of the perfect matchings for three specific types of graphs
• The enumeration of perfect matchings in two types of graphs
• The number of perfect matchings in four types of particular graphs
• scientific article; zbMATH DE number 6178330
• The number of perfect matchings in six types of graphs
• On the number of perfect matchings for some certain types of bipartite graphs
• On counting perfect matchings in general graphs
• The number of perfect matchings in five types of graphs

zbMATH Keywords

Hamilton cycleperfect matchinglinear recurrence relationedge cut

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The enumeration of perfect matchings in two types of graphs
• Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• Enumeration of maximum matchings in the Hanoi graphs using matching polynomials
• The number of perfect matchings, and the nesting properties, of random regular graphs
• Exact and asymptotic enumeration of perfect matchings in self-similar graphs
• On the upper bounds of the numbers of perfect matchings in graphs with given parameters
• Enumeration of perfect matchings in some type polyominoes
• Title not available (Why is that?)
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• On the number of matchings of graphs formed by a graph operation
• 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:

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