scientific article; zbMATH DE number 2239331

MaRDI QIDQ5714898zbMATH OpenFDO

Authors Khaled Salem

Publication date 16 December 2005

zbMATH Keywords

Clar numberClar theoryhexagonal system

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The Clar covering polynomial of hexagonal systems. III
• The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
• The Clar covering polynomial of hexagonal systems. I
• The complexity of the Clar number problem and an exact algorithm
• Fast computation of Clar formula for benzenoid graphs without nice coronenes

Cited in

(5)

• The complexity of the Clar number problem and an exact algorithm
• Fast computation of Clar formula for benzenoid graphs without nice coronenes
• scientific article; zbMATH DE number 913253 (Why is no real title available?)
• Hypergraphs and the Clar problem in hexagonal systems
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems

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