Authors: Gunnar Brinkmann 1; Jan Goedgebeur 1; Brendan D. Mckay 2
NULL##0000-0001-8984-2463##NULL
Gunnar Brinkmann;Jan Goedgebeur;Brendan D. Mckay
1 Department of Applied Mathematics and Computer Science [Ghent]
2 Research School of Computer Science [Canberra]
We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.
Garay, Barna; Vรกrdai, Judit, 2018, Moving Average Network Examples For Asymptotically Stable Periodic Orbits Of Monotone Maps, Electronic Journal Of Qualitative Theory Of Differential Equations, 52, pp. 1-18, 10.14232/ejqtde.2018.1.52.
Siehler, Jacob A., 2019, Xor-Magic Graphs, Recreational Mathematics Magazine, 6, 11, pp. 35-44, 10.2478/rmm-2019-0004.
Мелентьев, Виктор, 2022, Formal Method For The Synthesis Of Optimal Topologies Of Computing Systems Based On The Projective Description Of Graphs, The Journal Of Supercomputing, 78, 12, pp. 13915-13941, 10.1007/s11227-022-04421-7.