Distance-restricted matching extendability of fullerene graphs
type: Item
instance of: scholarly article
title: Distance-restricted matching extendability of fullerene graphs
zbMATH Open document ID: 1386.05152
author: Michitaka Furuya
author: Masanori Takatou
author: Shoichi Tsuchiya
publication date: 2018-03-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 92E10
zbMATH DE Number: 6852517
zbMATH Keywords: fullerene graph
zbMATH Keywords: perfect matching
zbMATH Keywords: matching extendability
MaRDI profile type: Publication
full work available at URL: s10910-017-0806-0
OpenAlex ID: W2756063248
cites work: Distance-restricted matching extension in triangulations of the torus and the Klein bottle
cites work: Q4820780
cites work: Distance-restricted matching extension in planar triangulations
cites work: Proximity thresholds for matching extension in planar and projective planar triangulations
cites work: Q5403515
cites work: On lower bounds of number of perfect matchings in fullerene graphs
cites work: Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
cites work: Edge Proximity Conditions for Extendability in Planar Triangulations
cites work: On the 2-extendability of planar graphs
cites work: Fullerene graphs have exponentially many perfect matchings
cites work: On n-extendable graphs
cites work: Q4732491
cites work: Forcing matching numbers of fullerene graphs
cites work: New lower bound on the number of perfect matchings in fullerene graphs
DOI: 10.1007/S10910-017-0806-0
published in: Journal of Mathematical Chemistry
Recommended article: Matchings in m-generalized fullerene graphs
Recommended article: Fullerene graphs with exponentially many perfect matchings
Recommended article: Forcing matching numbers of fullerene graphs
Recommended article: Shortest perfect pseudomatchings in fullerene graphs
Recommended article: On lower bounds of number of perfect matchings in fullerene graphs
Recommended article: Fullerene graphs have exponentially many perfect matchings
Recommended article: New lower bound on the number of perfect matchings in fullerene graphs
Recommended article: Distance matching extension and local structure of graphs
Recommended article: Metric dimension of fullerene graphs
Recommended article: On the diameter and some related invariants of fullerene graphs
description: scientific article; zbMATH DE number 6852517