NP-completeness of perfect matching index of cubic graphs

DOI10.4230/LIPICS.STACS.2022.56MaRDI QIDQ6491002zbMATH OpenFDO

Authors Martin Škoviera, Peter Varša

Publication date 23 April 2024

zbMATH Keywords

NP-completenesscoveringcubic graphperfect matchingedge colouringsnark

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: NP-completeness of perfect matching index of cubic graphs

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