Shortest perfect pseudomatchings in fullerene graphs

DOI10.1016/j.amc.2022.127026OpenAlexW4293255103MaRDI QIDQ2139733

Meysam Taheri-Dehkordi, Gholam Hossein Fath-Tabar, Tomislav Došlić

Publication date: 19 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127026

zbMATH Keywords

perfect matchingfullerene graphperfect pseudomatchingperfect star packing

Mathematics Subject Classification ID

Graph theory (05Cxx) Chemistry (92Exx) Combinatorics (05-XX)

Cites Work

• Exponentially many perfect matchings in cubic graphs
• Nice pairs of odd cycles in fullerene graphs
• Packing stars in fullerenes
• Fullerene graphs have exponentially many perfect matchings
• A note on the cyclical edge-connectivity of fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Matching theory
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• On some structural properties of fullerene graphs
• The chirality of icosahedral fullerenes: a comparison of the tripling (leapfrog), quadrupling (chamfering), and septupling (capra) transformations
• Onk-Resonant Fullerene Graphs
• The isolated-pentagon rule and nice substructures in fullerenes
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Unnamed Item

This page was built for publication: Shortest perfect pseudomatchings in fullerene graphs