1. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
2. Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York
3. Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in graphs: advanced topics. Marcel Dekker, New York
4. Haynes TW, Hedetniemi ST, Henning MA (2020) Topics in domination in graphs. Springer, Cham
5. Hung RW, Yao CC, Chan SJ (2015) The Hamiltonian properties of supergrid graphs. Theor Comput Sci 602:132–148