The graphs with maximum induced matching and maximum matching the same size


Kobler andRotics gave a polytime algorithm for deciding if a graph hasmaximum inducedmatching andmaximummatching the same size, and for finding amaximum inducedmatching in a graph where equality holds. We give a simple characterization of these graphs. Our characterization provides a simpler recognition algorithm. © 2005 Elsevier B.V. All rights reserved. 
DOI: 10.1016/j.disc.2004.07.022


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics