Domino Tatami Covering is NP-complete
Computational Complexity
2013-05-30 v1 Combinatorics
Abstract
A covering with dominoes of a rectilinear region is called \emph{tatami} if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering. As a consequence it is NP-complete to decide whether there is a perfect matching of a graph that meets every 4-cycle, even if the graph is restricted to be an induced subgraph of the grid-graph. The gadgets used in the reduction were discovered with the help of a SAT-solver.
Cite
@article{arxiv.1305.6669,
title = {Domino Tatami Covering is NP-complete},
author = {Alejandro Erickson and Frank Ruskey},
journal= {arXiv preprint arXiv:1305.6669},
year = {2013}
}
Comments
10 pages, accepted at The International Workshop on Combinatorial Algorithms (IWOCA) 2013