Well-indumatched Trees and Graphs of Bounded Girth

16 Dec 2019 Akbari S. Ekim T. Ghodrati A. H. Zare S.

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISCRETE MATHEMATICS
  • COMBINATORICS