Improved Lower Bounds on Book Crossing Numbers of Complete Graphs

@article{Klerk2013ImprovedLB,
title={Improved Lower Bounds on Book Crossing Numbers of Complete Graphs},
author={Etienne de Klerk and Dmitrii V. Pasechnik and Gelasio Salazar},
journal={SIAM J. Discrete Math.},
year={2013},
volume={27},
pages={619-633}
}

A book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The k-page crossing number νk(G) of a graph G is the minimum number of crossings in a k-page drawing of G. In this paper we investigate the k-page crossing… CONTINUE READING