Pages that link to "Item:Q1025749"
From MaRDI portal
The following pages link to An upper bound for the Clar number of fullerene graphs (Q1025749):
Displaying 17 items.
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\) (Q609604) (← links)
- On the Clar number of graphene fragment (Q830854) (← links)
- Nice pairs of disjoint pentagons in fullerene graphs (Q830887) (← links)
- Leapfrog fullerenes have many perfect matchings (Q937674) (← links)
- Extremal fullerene graphs with the maximum Clar number (Q967370) (← links)
- Sharp upper bounds on the Clar number of fullerene graphs (Q1692638) (← links)
- The complexity of the Clar number problem and an exact algorithm (Q1708506) (← links)
- Counting clar structures of \((4,6)\)-fullerenes (Q2008447) (← links)
- Hosoya entropy of fullerene graphs (Q2010674) (← links)
- Clar structures vs Fries structures in hexagonal systems (Q2318231) (← links)
- Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces (Q2336213) (← links)
- Packing resonant hexagons in fullerenes (Q2339827) (← links)
- 2-resonant fullerenes (Q2349955) (← links)
- Fullerenes with complete Clar structure (Q2446888) (← links)
- The fullerene graphs with a perfect star packing (Q5056834) (← links)
- Fullerenes with the maximum Clar number (Q5962516) (← links)
