activity
20032011
most citedThe Orchard crossing number of an abstract graph

4 citations · 9 across the 7 of their papers we have counts for

collaborators
Showing 2008Show all

1 paper · 1 filter

math.CO2008

The Maximum of the Maximum Rectilinear Crossing Numbers of d-regular Graphs of Order n

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…