Showing math.COShow all
2 papers · 1 filter
math.CO2024
Design spectra for 6-regular graphs with 12 vertices
Anthony D. Forbes, Carrie G. Rutherford
The design spectrum of a simple graph is the set of positive integers such that there exists an edgewise decomposition of the complete graph into $n(n - 1)/(2 |E(G)|)…
math.CO2016
Designs for 24-vertex snarks
Anthony D. Forbes
The design spectrum problem is solved for the thirty-eight 24-vertex non-trivial snarks.