Pages that link to "Item:Q2493105"
From MaRDI portal
The following pages link to The independence numbers of fullerenes and benzenoids (Q2493105):
Displaying 12 items.
- Kekulé structures and the face independence number of a fullerene (Q875048) (← 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)
- A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← links)
- Packing resonant hexagons in fullerenes (Q2339827) (← links)
- A linear time algorithm for finding a maximum independent set of a fullerene (Q2364862) (← links)
- Computing the bipartite edge frustration of fullerene graphs (Q2370428) (← links)
- An upper bound on the independence number of benzenoid systems (Q2476249) (← links)
- Long cycles in fullerene graphs (Q5902228) (← links)
- (Q6039531) (← links)