A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs

DOI10.1007/s10910-005-5821-xzbMath1217.05192OpenAlexW2026323162MaRDI QIDQ551990

Jinghua He, Heping Zhang

Publication date: 21 July 2011

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

Full work available at URL: https://doi.org/10.1007/s10910-005-5821-x

zbMATH Keywords

plane graphfullereneKekulé structurebenzenoidresonant pattern

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (4)

On the sextet polynomial of fullerenes ⋮ Counting clar structures of \((4,6)\)-fullerenes ⋮ Influence of substance on the equilibrium translation rate for the isothermal and isobaric chemical reactions of ideal gases ⋮ An upper bound for the Clar number of fullerene graphs

Cites Work

• New lower bound on the number of perfect matchings in fullerene graphs
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs

This page was built for publication: A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs