The construction of cubic and quartic planar maps with prescribed face degrees
Discrete Applied Mathematics
A distance regular graph with intersection array (21, 16, 8; 1, 4, 14) does not exist
European Journal of Combinatorics
G-graphs for the cage problem: a new upper bound
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
High girth column-weight-two LDPC codes based on distance graphs
EURASIP Journal on Wireless Communications and Networking
Quasi-cyclic LDPC codes of column-weight two using a search algorithm
EURASIP Journal on Applied Signal Processing
Computation of best possible low degree expanders
Discrete Applied Mathematics
Controlled Markov chains, graphs, and Hamiltonicity
Foundations and Trends® in Stochastic Systems
Quasi-cyclic LDPC codes of column-weight two using a search algorithm
EURASIP Journal on Advances in Signal Processing
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
Mathematics of Operations Research
Topological configurations (n4) exist for all n≥17
European Journal of Combinatorics
On bipartite graphs of defect at most 4
Discrete Applied Mathematics
Drawing cubic graphs with the four basic slopes
GD'11 Proceedings of the 19th international conference on Graph Drawing
Communication: House of Graphs: A database of interesting graphs
Discrete Applied Mathematics
An independent set approach for the communication network of the GPS III system
Discrete Applied Mathematics
On the finite set of missing geometric configurations (n4)
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a 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 computing even large classes of graphs, like construction of the 4-regular graphs on 18 vertices and, for the first time, the 5-regular graphs on 16 vertices. Also in cases with given girth, some remarkable results are obtained. For instance, the 5-regular graphs with girth 5 and minimal number of vertices were generated in less than 1 h. There exist exactly four (5, 5)-cages. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 137–146, 1999