Quadrangulations with given vertex degrees
Similar to
triangulations with given vertex degrees,
in this part you can choose the number of vertices and the set of allowed vertex degrees.
Furthermore you can give upper and lower limits for the numbers of vertices of each degree
that must/may be present in the graph.
The generator used at the moment is designed to work efficiently in case of relatively
many allowed vertex degrees. For the future a reimplementation
of the algorithm described in Discr. Appl. Math. 128, pages 541554 is planned. This will
be applied in the case of few vertex degrees allowed.
