| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647985 | Discrete Mathematics | 2013 | 7 Pages |
Abstract
In this article we describe an algorithm to efficiently generate all regular directed graphs for a given number of vertices and given degree. The directed graphs are constructed from regular bipartite (undirected) graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gunnar Brinkmann,