The Clar formula of hexagonal polyhexes

MaRDI QIDQ2715060zbMATH OpenFDO

Authors Heping Zhang

Publication date 20 June 2001

Published in Journal of Xinjiang University. Natural Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• The total chromatic number of a hexagonal system
• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III
• Clar structures vs Fries structures in hexagonal systems
• scientific article; zbMATH DE number 3937224

Cited in

(9)

• An upper bound for the Clar number of fullerene graphs
• The Clar covering polynomial of hexagonal systems. I
• Counting clar structures of \((4,6)\)-fullerenes
• Continuous forcing spectrum of regular hexagonal polyhexes
• Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
• The total chromatic number of a hexagonal system
• scientific article; zbMATH DE number 3937224 (Why is no real title available?)
• scientific article; zbMATH DE number 6133292 (Why is no real title available?)
• Extremal fullerene graphs with the maximum Clar number

This page was built for publication: The Clar formula of hexagonal polyhexes

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