Unimodularity of the Clar number problem

DOI10.1016/j.laa.2006.07.026zbMath1186.05078OpenAlexW2043506060MaRDI QIDQ861006

Gary W. Atkinson, Hernán G. Abeledo

Publication date: 9 January 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.07.026

zbMATH Keywords

polyhedral combinatoricsClar numberFries numberunimodular matricesplane bipartite graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items

A maximum resonant set of polyomino graphs ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ On the Clar number of graphene fragment ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\) ⋮ Counterexamples to a proposed algorithm for fries structures of benzenoids ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ The complexity of the Clar number problem and an exact algorithm ⋮ The Clar formulas of a benzenoid system and the resonance graph ⋮ A min-max theorem for plane bipartite graphs ⋮ Counting clar structures of \((4,6)\)-fullerenes ⋮ Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems ⋮ Fullerenes with the maximum Clar number ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Clar structures vs Fries structures in hexagonal systems ⋮ Packing resonant hexagons in fullerenes ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Algebraic Characterizations of Unimodular Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item