References
- B. Grünbaum and G.C. Dhephard, Tilings & Patterns, second ed., Dover Publications Inc., Mineola, NY, 2016.
- F. Harrary, Graph Theory, Addison-Wesley Publ. Comp., Reading, Massachussets, Menlo Park, California, London, Don Mills, Ontario, 1969.
- E.D. Khalimsky, R. Kopperman, and P.R. Meyer, Computer graphics and connected topologies on finite ordered sets, Topology Appl. 36 (1990), 1–17. doi: 10.1016/0166-8641(90)90031-V
- T.Y. Kong, R. Kopperman, and P.R. Meyer, A topological approach to digital topology, Amer. Math. Monthly 98 (1991), 902–917. doi: 10.1080/00029890.1991.12000810
- T.Y. Kong and W. Roscoe, A theory of binary digital pictures, Comput. Vision Graphics Image Process. 32 (1985), 221–243. doi: 10.1016/S0734-189X(85)80070-0
- T.Y. Kong and A. Rosenfeld, Digital topology: Introduction and survey, Comput. Vision Graphics Image Process. 48 (1989), 357–393. doi: 10.1016/0734-189X(89)90147-3
- R. Kopperman, P.R. Meyer, and R.G. Wilson, Jordan surface theorem for three-dimensional digital spaces, Discrete Comput. Geom. 6 (1991), 155–161. doi: 10.1007/BF02574681
- A. Rosenfeld, Connectivity in digital pictures, J. Assoc. Comput. Mach. 17 (1970), 146–160. doi: 10.1145/321556.321570
- A. Rosenfeld, Digital topology, Amer. Math. Monthly 86 (1979), 621–630. doi: 10.1080/00029890.1979.11994873
- G. Sabidussi, Graph multiplication, Math. Z. 72 (1960), 446–457. doi: 10.1007/BF01162967
- J. Šlapal, Graphs with a path partition for structuring digital spaces, Inf. Sciences 233 (2013), 305–312. doi: 10.1016/j.ins.2013.01.011
- J. Šlapal, Walk-set induced connectedness in digital spaces, Carpathian J. Math. 33 (2017), 227–236. doi: 10.37193/CJM.2017.02.11
- J. Šlapal, Path-induced closure operators on graphs for defining digital Jordan surfaces, Open Math. 17 (2019), 1374–1380. doi: 10.1515/math-2019-0121