List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| Classification of some strongly regular subgraphs of the McLaughlin graph Discrete Mathematics | 2008-01-30 | Paper |
| The strongly regular (45,\,12,\,3,\,3) graphs The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
| The strongly regular (45,\,12,\,3,\,3) graphs The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
| Classification of three-class association schemes using backtracking with dynamic variable ordering Discrete Mathematics | 2005-10-26 | Paper |
| A computer-assisted proof of the uniqueness of the Perkel graph Designs, Codes and Cryptography | 2005-02-28 | Paper |
Research outcomes over time
This page was built for person: J. Degraer
