\input zb-basic
\input zb-ioport
\iteman{io-port 00867657}
\itemau{Piazza, B.L.; Ringeisen, Richard D.; Stueckle, S.K.}
\itemti{Properties of non-minimum crossings for some classes of graphs.}
\itemso{Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 2. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, MI, USA, May 30-June 3, 1988. New York: John Wiley \& Sons, Inc. Wiley-Interscience Publication. 975-989 (1991).}
\itemab
Summary: We investigate drawings of some graphs which are not minimum crossing drawings. Interest in the study of non-minimum drawings has arisen in many papers and has been of growing interest in recent years. Our goal here will be to present an upper bound for the number of crossings in a good drawing of a graph, modify this bound somewhat and display graphs which meet this new bound. In some cases we examine the possibility of interpolation results for numbers of crossings which lie between the usual and the maximum crossing numbers. After looking at graphs which do meet this new upper bound, we briefly look at the unsolved problem of determining the maximum crossing number of the $n$-cube.
\itemrv{~}
\itemcc{}
\itemut{crossing drawings; number of crossings; bound; crossing numbers}
\itemli{}
\end