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

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

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 (3,6)-fullerene graphs are not 2-extendable. In this contribution we examine what can be salvaged and under what conditions ca...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2021-07, Vol.298, p.1-6
1. Verfasser: Došlić, Tomislav
Format: Artikel
Sprache:eng
Schlagworte:
(3,6)-fullerene
2-extendability
Fullerene graph
Fullerenes
Matching
Perfect matching
Restricted 2- extendability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 (3,6)-fullerene graphs are not 2-extendable. In this contribution we examine 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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2021.03.010