Well-indumatched Trees and Graphs of Bounded Girth

S. Akbari, T. Ekim, A. H. Ghodrati +1

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…