Polyhedral graph

Polyhedral graph --- полиэдральный граф.

A polyhedral graph [math]\displaystyle{ G = (V,E,F) }[/math] with a vertex set [math]\displaystyle{ V }[/math], an edge set [math]\displaystyle{ E }[/math] and a face set [math]\displaystyle{ F }[/math] is a planar and 3-connected graph. A polyhedral graph [math]\displaystyle{ G = (V,E,F) }[/math] is called face transitive, if for each pair of faces [math]\displaystyle{ \alpha, \; \beta \in F }[/math] there is an automorphism [math]\displaystyle{ \phi_{\alpha, \beta} \alpha = \beta }[/math].