Fast generation of regular graphs and construction of cages

@article{Meringer1999FastGO,
  title={Fast generation of regular graphs and construction of cages},
  author={Markus Meringer},
  journal={Journal of Graph Theory},
  year={1999},
  volume={30},
  pages={137-146}
}
The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this paper an efficient algorithm to generate regular graphs with given number of vertices and vertex degree is introduced. The method is based on orderly generation refined by criteria to avoid isomorphism checking and combined with a fast test for canonicity. The implementation allows to compute even large classes of graphs, like construction of the 4-regular… CONTINUE READING