A new lower bound for the number of perfect matchings of line graph

DOI10.1016/j.ipl.2014.09.026zbMath1304.05114OpenAlexW2023916160MaRDI QIDQ477656

Xue Zhou

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.026

zbMATH Keywords

enumerationcombinatorial problemsline graphperfect matching2-connected graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On the number of perfect matchings in the line graph of a traceable graph

Cites Work

• Unnamed Item
• Matching theory
• Even circuits of prescribed clockwise parity
• On the number of perfect matchings of line graphs
• Dimers and amoebae
• The Complexity of Enumeration and Reliability Problems
• Graphs with 1-Factors
• Enumeration of perfect matchings in graphs with reflective symmetry