99 Elm Problems/Problem 94

94.a) Generate K-regular simple graphs with N nodes

94. b) In a K-regular graph all nodes have a degree of K; i.e. the number of edges incident in each node is K. How many (non-isomorphic!) 3-regular graphs with 6 nodes are there?

# # # THIS IS A STUB # # #

Example in Elm:

Result:

Solutions