A Circular-Arc Characterization of Certain Rectilinear Drawings
Mathematics and Natural Sciences
In this paper we give a construction that produces exactly those graphs having maximum rectilinear crossing number equal to the subthrackle bound. We then prove a theorem characterizing these graphs in terms of proper circular-are graphs. (C) 1995 John Wiley and Sons, Inc.
Journal of Graph Theory
Piazza, B. L.,
(1995). A Circular-Arc Characterization of Certain Rectilinear Drawings. Journal of Graph Theory, 20(1), 71-76.
Available at: https://aquila.usm.edu/fac_pubs/5896