On the number of perfect matchings of line graphs
From MaRDI portal
Publication:1946221
Recommendations
- A new lower bound for the number of perfect matchings of line graph
- Graphs with second smallest number of perfect matchings of line graphs.
- On the number of perfect matchings in the line graph of a traceable graph
- scientific article; zbMATH DE number 5952364
- scientific article; zbMATH DE number 1405497
Cited in
(17)- On perfect linegraph squares
- On the number of perfect matchings in the line graph of a traceable graph
- On perfect matchings of complements of line graphs
- Some physical and chemical indices of clique-inserted lattices
- scientific article; zbMATH DE number 15371 (Why is no real title available?)
- Touching perfect matchings and halving lines
- A new lower bound for the number of perfect matchings of line graph
- Graphs with second smallest number of perfect matchings of line graphs.
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
- Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings
- Maximum matchings in scale-free networks with identical degree distribution
- 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\)
- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
- On the number of perfect matchings of middle graphs
- On the statistics of dimer coverings and spanning trees on the silicate-type Sierpinski gasket
- Enumerating perfect matchings in line graphs of graphs with pendent edges
This page was built for publication: On the number of perfect matchings of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946221)