The paper presents the proof of the theorem saying that the genus of the boundary of a digital image is precisely half of the sum of the cycle ranks of three particular graphs. These are: the “foreground graph” and “background graph”, which capture topological information about the digital image and its complement, respectively, and the Reeb graph, relative to the natural height function, associated with the digital image’s boundary. Several additional results are proved as well.