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
4 Citations
41 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 41 references

A minimal problem concerning complete plane graphs

  • J. Blažek, M. Koman
  • 1964 Theory of Graphs and its Applications
  • 1963
Highly Influential
10 Excerpts

On the number of crossings in a complete graph

  • F. Harary, A. Hill
  • Proc. Edinburgh Math. Soc. (2) 13
  • 1963
Highly Influential
4 Excerpts

Sage: Open Source Mathematics Software (version 5.0)

  • W. Stein et. al
  • 2012
1 Excerpt

Enumerative Combinatorics

  • R. Stanley
  • volume 1, 2nd edition, Cambridge University Press
  • 2011

Solving MaxCut to Optimality by Intersecting Semidefinite and Polyhedral Relaxations , Math

  • G. Rinaldi, A. Wiegele
  • 2010

Comparing crossing numbers and biplanar crossing numbers using the probabilistic method

  • O. Sýkora E. Czabarka, L. A. Székely
  • Random Structures Algorithms
  • 2008

Similar Papers

Loading similar papers…