Well-indumatched Trees and Graphs of Bounded Girth

A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Akbari, S, Ekim, T, Ghodrati, A. H, Zare, S
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!