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

摘要

Kobler and Rotics gave a polytime algorithm for deciding if a graph has maximum induced matching and maximum matching the same size, and for finding a maximum induced matching in a graph where equality holds. We give a simple characterization of these graphs. Our characterization provides a simpler recognition algorithm.