Pages that link to "Item:Q1025756"
From MaRDI portal
The following pages link to Fullerene graphs with exponentially many perfect matchings (Q1025756):
Displaying 13 items.
- Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
- Finding more perfect matchings in leapfrog fullerenes (Q839358) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- Leapfrog fullerenes have many perfect matchings (Q937674) (← links)
- On cyclic edge-connectivity of fullerenes (Q944718) (← links)
- Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems (Q980378) (← links)
- On the automorphism group of polyhedral graphs (Q1731088) (← links)
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs (Q2026333) (← links)
- A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← links)
- Packing resonant hexagons in fullerenes (Q2339827) (← links)
- Polyhedral graphs via their automorphism groups (Q2423027) (← links)
- Counting perfect matchings in \(n\)-extendable graphs (Q2483418) (← links)
- On Certain Graph Theory Applications (Q3606093) (← links)
