Graphs with a path partition for structuring digital spaces

We introduce the concept of graphs with a path partition and define a special type of connectedness in these graphs. The connectedness is shown to have certain properties suitable for using graphs with a path partition as convenient background structures on digital spaces for the study of digital images. We introduce a family of such graphs on Z2Z2 and present a Jordan curve theorem for them.