Restricted 2-extendability of (3,6)-fullerenes
type: Item
instance of: scholarly article
title: Restricted 2-extendability of (3,6)-fullerenes
zbMATH Open document ID: 1470.05157
author: Tomislav Došlić
published in: Discrete Applied Mathematics
publication date: 2021-05-31T00:00:00Z
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.
Mathematics Subject Classification ID: 05C92
Mathematics Subject Classification ID: 92E10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7352768
zbMATH Keywords: fullerene graph
zbMATH Keywords: (3,6)-fullerene
zbMATH Keywords: perfect matching
zbMATH Keywords: 2-extendability
zbMATH Keywords: restricted 2-extendability
reviewed by: Xueliang Li
MaRDI profile type: Publication
full work available at URL: j.dam.2021.03.010
OpenAlex ID: W3144429450
cites work: On restricted matching extension in planar graphs
cites work: Q4820780
cites work: Restricted matching in graphs of small genus
cites work: Distance-restricted matching extension in planar triangulations
cites work: Q5408296
cites work: On some structural properties of fullerene graphs
cites work: Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
cites work: Distance-restricted matching extendability of fullerene graphs
cites work: The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
cites work: On the restricted matching extension of graphs on the torus and the Klein bottle
cites work: Matching theory
cites work: Q5659595
cites work: Q5280052
cites work: On bicriticality of (3,6)-fullerene graphs
cites work: Hexagonal resonance of (3,6)-fullerenes
cites work: New lower bound on the number of perfect matchings in fullerene graphs
DOI: 10.1016/J.DAM.2021.03.010
description: scientific article; zbMATH DE number 7352768