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
From MaRDI portal
(Redirected from Publication:1762983)
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
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
No records found
Cited in
No records found
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )
