Featured Image
Why is it important?
We present new complexity results and polynomially solvable special cases related to well-indumatched and perfectly well-indumatched graphs, respectively.
Read the Original
This page is a summary of: Graphs with maximal induced matchings of the same size, Discrete Applied Mathematics, September 2016, Elsevier,
DOI: 10.1016/j.dam.2016.08.015.
You can read the full text:
Contributors
The following have contributed to this page
