Pages that link to "Item:Q1600673"
From MaRDI portal
The following pages link to New lower bound on the number of perfect matchings in fullerene graphs (Q1600673):
Displaying 36 items.
- 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes (Q534343) (← links)
- A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs (Q551990) (← links)
- The anti-Kekulé number of graphs (Q830774) (← links)
- Nice pairs of disjoint pentagons in fullerene graphs (Q830887) (← links)
- Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
- Packing stars in fullerenes (Q830899) (← links)
- Finding more perfect matchings in leapfrog fullerenes (Q839358) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- A note on the cyclical edge-connectivity of fullerene graphs (Q926922) (← links)
- Saturation number of fullerene graphs (Q937610) (← links)
- Leapfrog fullerenes have many perfect matchings (Q937674) (← links)
- Cyclic edge-cuts in fullerene graphs (Q937688) (← links)
- On cyclic edge-connectivity of fullerenes (Q944718) (← links)
- Forcing matching numbers of fullerene graphs (Q968177) (← links)
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes (Q1003671) (← links)
- Fullerene graphs with exponentially many perfect matchings (Q1025756) (← links)
- On decompositions of leapfrog fullerenes (Q1029758) (← links)
- On lower bounds of number of perfect matchings in fullerene graphs (Q1280057) (← links)
- Distance-restricted matching extendability of fullerene graphs (Q1708507) (← links)
- On bicriticality of (3,6)-fullerene graphs (Q1734896) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs (Q2026333) (← links)
- Restricted 2-extendability of (3,6)-fullerenes (Q2028076) (← links)
- Shortest perfect pseudomatchings in fullerene graphs (Q2139733) (← links)
- On some structural properties of generalized fullerene graphs with 13 pentagonal faces (Q2275390) (← links)
- 2-resonant fullerenes (Q2349955) (← links)
- Matchings in m-generalized fullerene graphs (Q2958698) (← links)
- On Certain Graph Theory Applications (Q3606093) (← links)
- The isolated-pentagon rule and nice substructures in fullerenes (Q4629560) (← links)
- The fullerene graphs with a perfect star packing (Q5056834) (← links)
- A lower bound on the number of perfect matchings in benzenoid systems (Q5165189) (← links)
- (Q5403515) (← links)
- (Q5408295) (← links)
- Long cycles in fullerene graphs (Q5902228) (← links)
- Fullerenes with the maximum Clar number (Q5962516) (← links)
- Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs (Q6495263) (← links)
