Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of \(2 \times n\) rectangles

DOI10.1016/j.dam.2018.02.019zbMath1387.05119DBLPjournals/dam/LangnerW18OpenAlexW2795043257WikidataQ60692146 ScholiaQ60692146MaRDI QIDQ1752474

Johanna Langner, Henryk A. Witek

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.019

zbMATH Keywords

interfacetilingperfect matchingClar structureKekulé structureZhang-Zhang polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (2)

ZZ Polynomials of Regular m-tier Benzenoid Strips as Extended Strict Order Polynomials of Associated Posets Part 3. Compilation of Results for m=1-6 ⋮ Enumeration of Clar covers of parallelogram chains

Uses Software

• OEIS
• Zzdecomposer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domino tilings of rectangles with fixed width
• The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III
• Algorithm for generating generalized resonance structures of single zigzag chains based on interface theory
• A relation between Clar covering polynomial and cube polynomial

This page was built for publication: Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of \(2 \times n\) rectangles