Packing resonant hexagons in fullerenes
DOI10.1016/J.DISOPT.2014.05.002zbMATH Open1308.05087OpenAlexW2023510183MaRDI QIDQ2339827FDOQ2339827
Xiao-Feng Wang, Jessica Ann Carr, Dong Ye
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
Applications of mathematical programming (90C90) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A maximal cover of hexagonal systems
- Unimodularity of the Clar number problem
- An upper bound for the Clar number of fullerene graphs
- Onk-Resonant Fullerene Graphs
- Extremal fullerene graphs with the maximum Clar number
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- On cyclic edge-connectivity of fullerenes
- Fullerene graphs have exponentially many perfect matchings
- A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
- Fullerene graphs with exponentially many perfect matchings
- Fullerenes with complete Clar structure
- Odd Cycle Transversals and Independent Sets in Fullerene Graphs
- A note on the cyclical edge-connectivity of fullerene graphs
- Finding more perfect matchings in leapfrog fullerenes
- Leapfrog fullerenes have many perfect matchings
- The independence numbers of fullerenes and benzenoids
Cited In (5)
This page was built for publication: Packing resonant hexagons in fullerenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339827)
