Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)

DOI10.1016/j.disc.2023.113847MaRDI QIDQ6197712

Weigen Yan, Jingchao Lai, Xing Feng

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

line graphperfect matchingmiddle graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On the number of perfect matchings of line graphs
• The Complexity of Enumeration and Reliability Problems
• Graphs with 1-Factors
• PERFECT MATCHINGS OF FISHER GRAPHS OF CUBIC GRAPHS
• On the dimer problem of the vertex-edge graph of a cubic graph

This page was built for publication: Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)