Abstract
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...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have