Resolution Complexity of Perfect Matching Principles for Sparse Graphs
DOI10.1007/978-3-319-20297-6_15zbMath1466.68061OpenAlexW2126186984MaRDI QIDQ3194719
Dmitry Sokolov, Dmitry Itsykson, Mikhail Slabodkin
Publication date: 20 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_15
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
This page was built for publication: Resolution Complexity of Perfect Matching Principles for Sparse Graphs
