@InProceedings{skoviera_et_al:LIPIcs.STACS.2022.56,
author = {\v{S}koviera, Martin and Var\v{s}a, Peter},
title = {{NP-Completeness of Perfect Matching Index of Cubic Graphs}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
pages = {56:1--56:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-222-8},
ISSN = {1868-8969},
year = {2022},
volume = {219},
editor = {Berenbrink, Petra and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.56},
URN = {urn:nbn:de:0030-drops-158667},
doi = {10.4230/LIPIcs.STACS.2022.56},
annote = {Keywords: cubic graph, edge colouring, snark, perfect matching, covering, NP-completeness}
}