Domino Tatami Covering Is NP-Complete
A covering with dominoes of a rectilinear region is called 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 therefore 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.
KeywordsBoolean Formula Horizontal Edge Satisfying Assignment Domino Tiling Variable Gadget
Unable to display preview. Download preview PDF.
- 1.Biedl, T.: The complexity of domino tiling. In: Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG), pp. 187–190 (2005)Google Scholar
- 4.Erickson, A., Ruskey, F.: Enumerating maximal tatami mat coverings of square grids with v vertical dominoes. Submitted to a Journal (2013), http://arxiv.org/abs/1304.0070
- 5.Erickson, A., Ruskey, F., Schurch, M., Woodcock, J.: Monomer-dimer tatami tilings of rectangular regions. The Electronic Journal of Combinatorics 18(1) #P109, 24 pages (2011)Google Scholar
- 7.Knuth, D.E.: The Art of Computer Programming: Combinatorial Algorithms, Part 1, 1st edn., vol. 4A. Addison-Wesley Professional (January 2011)Google Scholar
- 8.Lewis, H.R.: Complexity of solvable cases of the decision problem for the predicate calculus. In: 19th Annual Symposium on Foundations of Computer Science, pp. 35–47 (October 1978)Google Scholar
- 12.Ruskey, F., Woodcock, J.: Counting fixed-height tatami tilings. The Electronic Journal of Combinatorics 16(1) #R126, 20 pages (2009)Google Scholar
- 13.Worman, C., Watson, M.D.: Tiling layouts with dominoes. In: Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG), pp. 86–90 (2004)Google Scholar