scientific article; zbMATH DE number 1187153

MaRDI QIDQ3840360zbMATH OpenFDO

Authors Gary W. Atkinson, Hernán G. Abeledo

Publication date 10 August 1998

zbMATH Keywords

network flowstrong dualityClar numberminimum weight cut cover problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• On the Tutte polynomial of benzenoid chains
• scientific article; zbMATH DE number 4008446
• The Tutte polynomials of catacondensed benzenoid systems
• A study about the Tutte polynomials of benzenoid chains
• Computing the number of \(k\)-matchings in benzenoid chains
• A combinatorial/geometric analysis of parallelogram-like benzenoids
• Counting Perfect Matchings in Hexagonal Systems Associated with Benzenoids
• Computing the number of matchings in catacondensed benzenoid systems
• scientific article; zbMATH DE number 1890132

Cited in

(10)

• PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
• Complete Forcing Numbers of Polyphenyl Systems
• A network flow approach to a common generalization of Clar and Fries numbers
• Unimodularity of the Clar number problem
• How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids
• A mathematical problem in isomerism and radicality of acyclic conjugated polyenes
• A min-max theorem for plane bipartite graphs
• Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
• scientific article; zbMATH DE number 1522741 (Why is no real title available?)
• scientific article; zbMATH DE number 5584961 (Why is no real title available?)

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 Q3840360)