Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size

Daniel Kobler, Udi Rotics. Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. Algorithmica, 37(4):327-346, 2003. [doi]

Abstract

Abstract is missing.