Distance-restricted matching extendability of fullerene graphs

DOI10.1007/s10910-017-0806-0zbMath1386.05152OpenAlexW2756063248MaRDI QIDQ1708507

Michitaka Furuya, Masanori Takatou, Shoichi Tsuchiya

Publication date: 23 March 2018

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

Full work available at URL: https://doi.org/10.1007/s10910-017-0806-0

zbMATH Keywords

perfect matchingfullerene graphmatching extendability

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)

Related Items (1)

Restricted 2-extendability of (3,6)-fullerenes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-restricted matching extension in planar triangulations
• Distance-restricted matching extension in triangulations of the torus and the Klein bottle
• Fullerene graphs have exponentially many perfect matchings
• Forcing matching numbers of fullerene graphs
• On n-extendable graphs
• On the 2-extendability of planar graphs
• On lower bounds of number of perfect matchings in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• New lower bound on the number of perfect matchings in fullerene graphs
• Edge Proximity Conditions for Extendability in Planar Triangulations
• Proximity thresholds for matching extension in planar and projective planar triangulations

This page was built for publication: Distance-restricted matching extendability of fullerene graphs