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

DOI10.1016/J.DAM.2022.12.011zbMath1505.05069OpenAlexW4313216322MaRDI QIDQ2112658

Yinzhu Ye, Hai-Yan Chen

Publication date: 11 January 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.011

zbMATH Keywords

line graphcaterpillar treeperfect matchingtraceable graph

Mathematics Subject Classification ID

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

Cites Work

• A new lower bound for the number of perfect matchings of line graph
• Matching theory
• On the number of perfect matchings of line graphs
• The Complexity of Enumeration and Reliability Problems
• Graphs with 1-Factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of perfect matchings in the line graph of a traceable graph