Domino Tatami Covering is NP-complete

@article{Erickson2013DominoTC,
  title={Domino Tatami Covering is NP-complete},
  author={Alejandro Erickson and Frank Ruskey},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.6669}
}
  • Alejandro Erickson, Frank Ruskey
  • Published 2013
  • Computer Science, Mathematics
  • ArXiv
  • 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. 

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    Tatami Maker: A combinatorially rich mechanical game board

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    NP-completeness of the game Kingdomino

    VIEW 1 EXCERPT
    CITES BACKGROUND

    NP-completeness of the game KingdominoTM

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES

    Complexity of Cycle Transverse Matching Problems

    VIEW 1 EXCERPT

    Counting Fixed-Height Tatami Tilings

    VIEW 2 EXCERPTS

    Rectilinear planar layouts and bipolar orientations of planar graphs

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    On a Problem of Marco Buratti

    Planar Formulae and Their Uses

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL