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

DOI10.1007/S10910-005-5821-XzbMATH Open1217.05192OpenAlexW2026323162MaRDI QIDQ551990FDOQ551990

Heping Zhang, Jinghua He

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 graphbenzenoid[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Kekul%EF%BF%BD%EF%BF%BD+structure&go=Go Kekul�� structure]fullereneresonant 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)

Cites Work

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

Cited In (4)

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

   Recommendations

• 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes 👍 👎
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs 👍 👎
• Counting clar structures of \((4,6)\)-fullerenes 👍 👎
• A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs 👍 👎
• 2-resonant fullerenes 👍 👎

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

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