Pages that link to "Item:Q1614157"
From MaRDI portal
The following pages link to On some structural properties of fullerene graphs (Q1614157):
Displaying 27 items.
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing (Q471143) (← 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)
- Cyclic 7-edge-cuts in fullerene graphs (Q848197) (← 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)
- Fullerene graphs with exponentially many perfect matchings (Q1025756) (← links)
- On decompositions of leapfrog fullerenes (Q1029758) (← links)
- On the automorphism group of polyhedral graphs (Q1731088) (← links)
- On bicriticality of (3,6)-fullerene graphs (Q1734896) (← links)
- Restricted 2-extendability of (3,6)-fullerenes (Q2028076) (← links)
- The density of fan-planar graphs (Q2121760) (← 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)
- 2-resonant fullerenes (Q2349955) (← links)
- Computing the bipartite edge frustration of fullerene graphs (Q2370428) (← links)
- Polyhedral graphs via their automorphism groups (Q2423027) (← links)
- The isolated-pentagon rule and nice substructures in fullerenes (Q4629560) (← links)
- Long cycles in fullerene graphs (Q5902228) (← links)
- Removable and forced subgraphs of graphs (Q6495257) (← links)
