1 paper
Matthew Alpert, Elie Feder, Heiko Harborth
We extend known results regarding the maximum rectilinear crossing number of the cycle graph (C_n) and the complete graph (K_n) to the class of general d-regular graphs R_{n,d}. We…