An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs

DOI10.1016/S0020-0190(97)00081-1zbMATH Open1336.05131OpenAlexW2062510888MaRDI QIDQ287094

Author name not available (Why is that?)

Publication date: 26 May 2016

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00081-1

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287094)