scientific article; zbMATH DE number 1522741
From MaRDI portal
Publication:4511016
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matrices of integers (15B36) Linear programming (90C05) Programming involving graphs or networks (90C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Recommendations
Cited in
(19)- An upper bound for the Clar number of fullerene graphs
- The complexity of the Clar number problem and an exact algorithm
- Counterexamples to a proposed algorithm for fries structures of benzenoids
- How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids
- On the role of hypercubes in the resonance graphs of benzenoid graphs
- Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
- Clar and fries numbers for benzenoids
- Fast computation of Clar formula for benzenoid graphs without nice coronenes
- Pairwise disagreements of Kekulé, Clar, and Fries numbers for benzenoids: a mathematical and computational investigation
- A network flow approach to a common generalization of Clar and Fries numbers
- Tight upper bounds for the p-anionic Clar number of fullerenes
- Clar and Fries structures for fullerenes
- Unimodularity of the Clar number problem
- Hypergraphs and the Clar problem in hexagonal systems
- A min-max result on outerplane bipartite graphs
- Kekulé structures and the face independence number of a fullerene
- Extremal fullerene graphs with the maximum Clar number
- A min-max theorem for plane bipartite graphs
- Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511016)
