Removable Edges in Claw-Free Bricks

An edge e in a matching covered graph G is removable if G - e is matching covered. Removable edges were introduced by Lovász and Plummer in connection with ear decompositions of matching covered graphs. A brick is a non-bipartite matching covered graph without non-trivial tight cuts. The importance...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2024-05, Vol.40 (3), Article 43
Hauptverfasser:	Wu, Xiaoxia, Lu, Fuliang, Zhang, Lianzhu
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Bricks Combinatorics Engineering Design Graph matching Graph theory Graphs Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!