On the complexity of identifying strongly regular graphs

Michael Levet. On the complexity of identifying strongly regular graphs. Australasian J. Combinatorics, 87:41-67, October 2023. [doi]

Authors

Michael Levet

This author has not been identified. Look up 'Michael Levet' in Google