On the sextet polynomial of fullerenes

DOI10.1007/s10910-009-9640-3zbMath1186.92062OpenAlexW1971898678MaRDI QIDQ965853

Matěj Stehlík, Jean-Sébastien Sereni

Publication date: 26 April 2010

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

Full work available at URL: https://doi.org/10.1007/s10910-009-9640-3

zbMATH Keywords

fullerenesperfect matchingsresonant patternsextet polynomialKekulé count

Mathematics Subject Classification ID

Applications of graph theory (05C90) 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

• A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the sextet polynomial of fullerenes