The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order

DOI10.2298/AADM181016002DOpenAlexW2935854523WikidataQ122918491 ScholiaQ122918491MaRDI QIDQ5091834

Jelena Đokić, Bojana Pantić, Rade Doroslovački, Olga Bodroža-Pantić

Publication date: 27 July 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm181016002d

zbMATH Keywords

generating functionnear-perfect matchingsgrid cylinder

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetry types of periodic sequences
• On dimer coverings of rectangles of fixed width
• Generating Bracelets in Constant Amortized Time
• A mechanical counting method and combinatorial applications

This page was built for publication: The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order