The 2-page crossing number of \(K_{n}\)
Publication:2391708
DOI10.1007/s00454-013-9514-0zbMath1269.05078OpenAlexW43174409MaRDI QIDQ2391708
Gelasio Salazar, Pedro A. Ramos, Bernardo M. Ábrego, Silvia Fernández-Merchant, Oswin Aichholzer
Publication date: 5 August 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9514-0
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Specialized structures on manifolds (spin manifolds, framed manifolds, etc.) (57R15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
- Axioms and hulls
- Special numbers of crossings for complete graphs
- Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)
- The early history of the brick factory problem
- Approximating the fixed linear crossing number
- A lower bound for the rectilinear crossing number
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- The 2-page crossing number of K n
- Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- The book crossing number of a graph
- The toroidal crossing number of the complete graph
- On the Number of Crossings in a Complete Graph
This page was built for publication: The 2-page crossing number of \(K_{n}\)