1. [1] https://www.nikoli.co.jp/en/puzzles/chained-block/
2. [2] A. Adler, J. Bosboom, E.D. Demaine, M.L. Demaine, Q.C. Liu, and J. Lynch, “Tatamibari is NP-complete,” Proc. 10th Int. Conf. Fun with Algorithms, LIPICS, vol.157, pp.1:1-1:24, 2021. DOI:10.4230/LIPIcs.FUN.2021.1 10.4230/LIPIcs.FUN.2021.1
3. [3] M.R. Cerioli, L. Faria, T.O. Ferreira, C.A.J. Martinhon, F. Protti, and B. Reed, “Partition into cliques for cubic graphs: planar case, complexity and approximation,” Discrete Appl. Math., vol.156, no.12, pp.2270-2278, 2008. DOI:10.1016/j.dam.2007.10.015 10.1016/j.dam.2007.10.015
4. [4] D. Đurić, “Double Choco is NP-complete,” arXiv:2203.02815, pp.1-35, 2022. DOI:10.48550/arXiv.2203.02815 10.48550/arXiv.2203.02815
5. [6] C. Iwamoto and T. Ide, “Computational complexity of Nurimisaki and Sashigane,” IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, vol.E103-A, no.10, pp.1183-1192, 2020. DOI:10.1587/transfun.2019DMP0002 10.1587/transfun.2019dmp0002