Hypergraphs and the Clar problem in hexagonal systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831965 (Why is no real title available?)
- scientific article; zbMATH DE number 3859146 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1522741 (Why is no real title available?)
- scientific article; zbMATH DE number 4198027 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 2239331 (Why is no real title available?)
- scientific article; zbMATH DE number 2239332 (Why is no real title available?)
- scientific article; zbMATH DE number 4189780 (Why is no real title available?)
- Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
- The Clar covering polynomial of hexagonal systems. I
- The Clar covering polynomial of hexagonal systems. III
Cited in
(2)
This page was built for publication: Hypergraphs and 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 Q865759)