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

DOI10.1016/J.DAM.2021.03.010MaRDI QIDQ2028076zbMATH OpenOpenAlexFDO

Authors Tomislav Došlić

Publication date 31 May 2021

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

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

zbMATH Keywords

(3,6)-fullerene2-extendabilityfullerene graphperfect matchingrestricted 2-extendability

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

A (3,6)-fullerene is an infinite family of cubic planar graphs with only hexagonal and triangular faces. A graph \(G\) with a perfect matching is \(k\)-extendable if it has a matching of size \(k\) and if every such matching can be extended to a perfect matching in \(G\). It is well known that no (3,6)-fullerene graph is 2-extendable. In this paper, the author examines what can be salvaged and under what conditions can a matching of size two be extended to a perfect matching in a (3,6)-fullerene graph.

Recommendations

• Distance-restricted matching extendability of fullerene graphs
• scientific article; zbMATH DE number 871171
• Matchings and matching extensions in graphs
• Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
• Publication:4729833

Cites work

• Cyclical edge-connectivity of fullerene graphs and (k,6)-cages
• Distance-restricted matching extendability of fullerene graphs
• Distance-restricted matching extension in planar triangulations
• Forcing and anti-forcing numbers of (3,6)-fullerenes
• Hexagonal resonance of (3,6)-fullerenes
• scientific article; zbMATH DE number 2104730 (Why is no real title available?)
• scientific article; zbMATH DE number 3390835 (Why is no real title available?)
• Matching theory
• New lower bound on the number of perfect matchings in fullerene graphs
• On bicriticality of (3,6)-fullerene graphs
• On restricted matching extension in planar graphs
• On some structural properties of fullerene graphs
• On the number of matchings and independent sets in \((3,6)\)-fullerenes
• On the restricted matching extension of graphs on the torus and the Klein bottle
• Restricted matching in graphs of small genus
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

Cited in

(3)

• On bicriticality of (3,6)-fullerene graphs
• scientific article; zbMATH DE number 4114690 (Why is no real title available?)
• Bounds on the estrada index of ISR (4,6)-fullerenes

This page was built for publication: Restricted 2-extendability of (3,6)-fullerenes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028076)