Some news about oblique graphs
Andrey A. Dobrynin, Leonid S. Mel’nikov, Jens Schreyer, H. Walther · Discussiones Mathematicae Graph Theory · 2002
A k-gon alpha of a polyhedral graph G(V,E,F) is of type if the vertices incident with alpha in cyclic order have degrees b1, b2,...,bk and $ is the lexicographic minimum of all such sequences available for alpha. A polyhedral graph G is oblique if it has no two faces of the same type. Among others it is shown that an oblique graph contains vertices of degree 3.