Perfect Pseudo-Matchings in cubic graphs

A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings since G-E(C) is a perfect pseudo-matching. Of special interes...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fleischner, Herbert, Gh, Behrooz Bagheri, Klocker, Benedikt
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!