P339: Enumeration of all 3-polytopes of a graph

P339: Enumeration of all 3-polytopes of a graph

Input:

A graph $G = (V, E)$.

Output:

All 3-polytopes of $G$.

Complexity:

Comment:

Reference:

[Deza1993] (Bibtex)