Pages that link to "Item:Q2958698"
From MaRDI portal
The following pages link to Matchings in m-generalized fullerene graphs (Q2958698):
Displaying 14 items.
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes (Q712590) (← links)
- Finding more perfect matchings in leapfrog fullerenes (Q839358) (← links)
- Fullerene graphs with exponentially many perfect matchings (Q1025756) (← links)
- On lower bounds of number of perfect matchings in fullerene graphs (Q1280057) (← links)
- Partition of \(\pi \)-electrons among the faces of polyhedral carbon clusters (Q1617586) (← links)
- Distance-restricted matching extendability of fullerene graphs (Q1708507) (← links)
- Upper bounds for perfect matchings in Pfaffian and planar graphs (Q1953454) (← links)
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs (Q2026333) (← links)
- On some structural properties of generalized fullerene graphs with 13 pentagonal faces (Q2275390) (← links)
- On 2-distance-balanced graphs (Q4615055) (← links)
- Saturation number of lattice animals (Q4615062) (← links)
- Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications (Q4617687) (← links)
- (Q5403515) (← links)
- (Q5408295) (← links)