Distance-restricted matching extendability of fullerene graphs

A fullerene graph is a 3-connected cubic plane graph whose all faces are bounded by 5- or 6-cycles. In this paper, we show that a matching M of a fullerene graph can be extended to a perfect matching if the following hold: (i) three faces around each vertex in { x , y : x y ∈ M } are bounded by 6-cy...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical chemistry 2018-02, Vol.56 (2), p.606-617
Main Authors: Furuya, Michitaka, Takatou, Masanori, Tsuchiya, Shoichi
Format: Article
Language:English
Subjects:
Chemistry
Chemistry and Materials Science
Math. Applications in Chemistry
Original Paper
Physical Chemistry
Theoretical and Computational Chemistry
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A fullerene graph is a 3-connected cubic plane graph whose all faces are bounded by 5- or 6-cycles. In this paper, we show that a matching M of a fullerene graph can be extended to a perfect matching if the following hold: (i) three faces around each vertex in { x , y : x y ∈ M } are bounded by 6-cycles and (ii) the edges in M lie at distance at least 13 pairwise.
ISSN:0259-9791
1572-8897
DOI:10.1007/s10910-017-0806-0