A circular‐arc characterization of certain rectilinear drawings
Sam K. Stueckle, Barry L. Piazza, Richard D. Ringeisen · Journal of Graph Theory · 1995
Abstract 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‐arc graphs. © 1996 John Wiley & Sons, Inc.