On the number of perfect matchings of line graphs
From MaRDI portal
Publication:1946221
DOI10.1016/j.dam.2012.10.032zbMath1262.05123OpenAlexW4318612841MaRDI QIDQ1946221
Weigen Yan, Fengming Dong, Fu Ji Zhang
Publication date: 18 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.032
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)
Related Items (7)
On the dimer problem of the vertex-edge graph of a cubic graph ⋮ Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\) ⋮ A new lower bound for the number of perfect matchings of line graph ⋮ Some physical and chemical indices of clique-inserted lattices ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm ⋮ On the number of perfect matchings in the line graph of a traceable graph
This page was built for publication: On the number of perfect matchings of line graphs
