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

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.46

zbMATH Keywords

exact matchingindependence numberparameterized complexityperfect matching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Solution discovery via reconfiguration for problems in P
• The algorithmic complexity of the paired matching problem
• On the exact matching problem in dense graphs
• Exact matching: correct parity and FPT parameterized by independence number
• On the complexity of finding central configurations of the graph-generalized ( n^2 - 1 )-puzzle
• On finding -th smallest perfect matchings

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)