Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems

DOI10.1007/S10910-005-9051-ZzbMATH Open1145.90469OpenAlexW2078242139MaRDI QIDQ2503758FDOQ2503758

Authors: Khaled Salem, Hernán G. Abeledo 

Publication date: 22 September 2006

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-005-9051-z

Recommendations

• Unimodularity of the Clar number problem
• scientific article; zbMATH DE number 1522741
• The Clar formula of hexagonal polyhexes
• scientific article; zbMATH DE number 1187153
• The Clar covering polynomial of hexagonal systems. I

zbMATH Keywords

linear programminginteger programmingbenzenoidhexagonalresonant

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of mathematical programming (90C90)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic Characterizations of Unimodular Matrices

Cited In (3)

• Hypergraphs and the Clar problem in hexagonal systems
• Computing sparse and dense realizations of reaction kinetic systems
• The complexity of the Clar number problem and an exact algorithm

This page was built for publication: Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems

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