Generation of Delaney-Dress graphs
Abstract
We introduce an algorithm for the efficient generation of cubic pregraphs which have a 2-factor in which each component is a quotient of C4. This class of pregraphs is of particular interest, since it corresponds to the class of uncoloured graphs that are the underlying graphs of Delaney-Dress graphs. We also extend the algorithm to generate Delaney-Dress graphs.
0