Exact matching in graphs of bounded independence number

DOI10.4230/LIPICS.MFCS.2022.46MaRDI QIDQ6584045zbMATH OpenFDO

Authors Nicolas El Maalouly, Raphael Steiner

Publication date 6 August 2024

zbMATH Keywords

parameterized complexityperfect matchingindependence numberexact matching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Exact matching in graphs of bounded independence number

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