Unimodularity of the Clar number problem

DOI10.1016/J.LAA.2006.07.026MaRDI QIDQ861006zbMATH OpenOpenAlexFDO

Authors 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

Clar numberFries numberplane bipartite graphspolyhedral combinatoricsunimodular matrices

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1522741
• A min-max theorem for plane bipartite graphs
• scientific article; zbMATH DE number 1187153
• Binomial-combinatorial properties of Clar structures
• The complexity of the Clar number problem and an exact algorithm

Cites work

• Algebraic Characterizations of Unimodular Matrices
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1187153 (Why is no real title available?)
• scientific article; zbMATH DE number 1522741 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

Cited in

(26)

• The complexity of the Clar number problem and an exact algorithm
• Perfect Clar structures and 3-homogeneous simplicial complexes
• Counterexamples to a proposed algorithm for fries structures of benzenoids
• Counting clar structures of \((4,6)\)-fullerenes
• Some tight bounds on the minimum and maximum forcing numbers of graphs
• Some novel minimax results for perfect matchings of hexagonal systems
• Clar structures vs Fries structures in hexagonal systems
• Packing resonant hexagons in fullerenes
• Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
• A maximum resonant set of polyomino graphs
• A minimax result for perfect matchings of a polyomino graph
• scientific article; zbMATH DE number 1522741 (Why is no real title available?)
• Fullerenes with the maximum Clar number
• Anti-forcing numbers of perfect matchings of graphs
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
• A network flow approach to a common generalization of Clar and Fries numbers
• Tight upper bounds for the p-anionic Clar number of fullerenes
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Clar and Fries structures for fullerenes
• Perfect matchings of (4, 6)-fullerenes with largest forcing number
• Resonance graphs of plane bipartite graphs as daisy cubes
• On the Clar number of graphene fragment
• The Clar formulas of a benzenoid system and the resonance graph
• 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: Unimodularity of the Clar number problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861006)