Publikationen

Let G=G(V;E;F) be a polyhedral graph with vertex set V, edge set E and face set F. e=(x,y,alpha,beta) in E(G) denotes an edge incident with the two vertices x, y in V(G) with d(x)<=d(y), and incident with the two faces alpha, beta in F(G) with d(alpha)<=d(beta). - [d(x),d(y);d(alpha),d(beta)] is the type of the face e=(x,y;alpha,beta). A graph which contains no two edges of a common edge-type is called edge-oblique and if it contains at most z faces of each type it is called z-edge-oblique. In this work we shall prove, that there is only a finite number of edge-oblique and z-edge-oblique graphs. For the first case some bounds for the maximum degree and the number of edges are given.