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]
@article{KoblerR03,
title = {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},
author = {Daniel Kobler and Udi Rotics},
year = {2003},
doi = {10.1007/s00453-003-1035-4},
url = {http://dx.doi.org/10.1007/s00453-003-1035-4},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KoblerR03},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {37},
number = {4},
pages = {327-346},
}