Pages that link to "Item:Q839387"
From MaRDI portal
The following pages link to Fullerene graphs have exponentially many perfect matchings (Q839387):
Displayed 13 items.
- Bipartizing fullerenes (Q427819) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Nice pairs of disjoint pentagons in fullerene graphs (Q830887) (← links)
- Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
- Distance-restricted matching extendability of fullerene graphs (Q1708507) (← links)
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs (Q2026333) (← links)
- Shortest perfect pseudomatchings in fullerene graphs (Q2139733) (← links)
- On some structural properties of generalized fullerene graphs with 13 pentagonal faces (Q2275390) (← links)
- A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← links)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions (Q2285396) (← links)
- Packing resonant hexagons in fullerenes (Q2339827) (← links)
- 2-resonant fullerenes (Q2349955) (← links)
- Long cycles in fullerene graphs (Q5902228) (← links)