Counting clar structures of \((4,6)\)-fullerenes
From MaRDI portal
Publication:2008447
DOI10.1016/j.amc.2018.10.027zbMath1428.05301OpenAlexW2899851681WikidataQ128968095 ScholiaQ128968095MaRDI QIDQ2008447
Publication date: 25 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.10.027
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- On forcing matching number of boron-nitrogen fullerene graphs
- A fully benzenoid system has a unique maximum cardinality resonant set
- Unimodularity of the Clar number problem
- Closed-form formulas for the Zhang-Zhang polynomials of benzenoid structures: prolate rectangles and their generalizations
- A min-max theorem for plane bipartite graphs
- An upper bound for the Clar number of fullerene graphs
- The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
- The Clar covering polynomial of hexagonal systems. I
- The Clar covering polynomial of hexagonal systems. III
- Clar structures vs Fries structures in hexagonal systems
- Clar structure and fries set of fullerenes and \((4,6)\)-fullerenes on surfaces
- Packing resonant hexagons in fullerenes
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
- Fullerenes with complete Clar structure
- Onk-Resonant Fullerene Graphs
- On the Clar Number of Benzenoid Graphs
- Fullerenes with the maximum Clar number
