Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs)) (Q912133)

\({\mathfrak P}^ d\) denotes the family of all convex d-polytopes and a graph G is called (\({\mathfrak P}^ 3)\)-realizable iff there exist a polytope \(P\in {\mathfrak P}^ d\) so that G is isomorphic to skel P and it is also said: G is the graph of P. A characterization of these graphs G is given by the well-known theorem of Steinitz: A finite, simple graph G is (\({\mathfrak P}^ 3)\)-realizable iff G is planar and 3-connected. Generalizing this result in the present paper the author tries to examine certain systems of cycles to describe such graphs G. Therefore in section 1 are defined the so-called t-cycle- complete graphs which are connected subgraphs U of finite, simple, connected graphs G with certain systems \({\mathfrak K}\) of pairwise disjoint cycles and for which the corresponding systems \({\mathfrak K}_ U\) satisfying certain conditions (e.g. every edge of U is member of exactly t cycles of \({\mathfrak K}_ U)\). Further G is defined to be a \({\mathfrak K}\)- graph if G contains a system \({\mathfrak K}\) of cycles with special properties. And in this section are proved numerous (altogether 7) properties with respect to these systems \({\mathfrak K}\) and to t-cycle- complete graphs and their subgraphs. In section 2 results are stated referring to the structure of \({\mathfrak K}\)-graphs, e.g. the theorem that every t-cycle-complete \({\mathfrak K}\)- graph G is \((t+1)\)-connected (t\(\geq 1).\) And section 3 yields the theorem that G is a 2-cycle-complete \({\mathfrak K}\)-graph if and only if G is a finite, simple, planar and 3-connected one. The consequence of this theorem and the investigations is the main theorem: A graph G is (\({\mathfrak P}^ 3)\)-realizable if and only if G is a 2-cycle-complete \({\mathfrak K}\)-graph.