Pages that link to "Item:Q967370"
From MaRDI portal
The following pages link to Extremal fullerene graphs with the maximum Clar number (Q967370):
Displaying 22 items.
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- Labelings of type \((1, 1, 1)\) for Klein bottle fullerenes (Q283790) (← 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)
- On the sextet polynomial of fullerenes (Q965853) (← links)
- An upper bound for the Clar number of fullerene graphs (Q1025749) (← links)
- Fullerene graphs with exponentially many perfect matchings (Q1025756) (← 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)
- A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← 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)
- Super face d-antimagic labeling for disjoint union of toroidal fullerenes (Q2362136) (← links)
- Fullerenes with complete Clar structure (Q2446888) (← links)
- (Q2975341) (← links)
- (Q5280018) (← links)
- (Q5299397) (← links)
- Fullerenes with the maximum Clar number (Q5962516) (← links)