Resolution complexity of perfect mathcing principles for sparse graphs

Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov. Resolution complexity of perfect mathcing principles for sparse graphs. Electronic Colloquium on Computational Complexity (ECCC), 21:93, 2014. [doi]

Abstract

Abstract is missing.