Packing resonant hexagons in fullerenes
From MaRDI portal
Publication:2339827
DOI10.1016/j.disopt.2014.05.002zbMath1308.05087MaRDI QIDQ2339827
Jessica Ann Carr, Dong Ye, Xiao-Feng Wang
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.05.002
90C90: Applications of mathematical programming
90C10: Integer programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The fullerene graphs with a perfect star packing, Fullerenes with the maximum Clar number, Counting clar structures of \((4,6)\)-fullerenes, Clar structures vs Fries structures in hexagonal systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
- Finding more perfect matchings in leapfrog fullerenes
- Fullerene graphs have exponentially many perfect matchings
- Unimodularity of the Clar number problem
- A note on the cyclical edge-connectivity of fullerene graphs
- Leapfrog fullerenes have many perfect matchings
- On cyclic edge-connectivity of fullerenes
- Extremal fullerene graphs with the maximum Clar number
- An upper bound for the Clar number of fullerene graphs
- Fullerene graphs with exponentially many perfect matchings
- A maximal cover of hexagonal systems
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Fullerenes with complete Clar structure
- The independence numbers of fullerenes and benzenoids
- Onk-Resonant Fullerene Graphs
- Odd Cycle Transversals and Independent Sets in Fullerene Graphs
