The subsequent statements are extracted from the article titled 'Generating r-regular graphs' (https://doi.org/10.1016/S0166-218X(02)00593-0).

A well-known classical theorem of Steinitz and Rademacher [22] states that the class $\mathcal{G}$ of 3-connected 3-regular planar simple graphs can be generated from the Tetrahedron by adding handles, a graph operation illustrated in Fig. 1 below.

**[22] E. Steinitz, H. Rademacher, Vorlesungen über die Theorie de Polyeder, Berlin, 1934.**

In my manuscript, I similarly express this statement and cite the reference [22]; however, the reviewer mentioned that: **[22] is a whole book. Write exactly to which part you refer.**
As the original book is in German, I am uncertain about the particular chapter or section that discusses this theorem.
Is there someone familiar with German who can help check which specific chapter in the book this theorem is in? Thank you in advance.

Additionally, I would like to inquire whether there is an English version of this book.