The 2-page crossing number of \(K_{n}\)
From MaRDI portal
Publication:2391708
DOI10.1007/s00454-013-9514-0zbMath1269.05078MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
52C10: Erd?s problems and related topics of discrete geometry
57R15: Specialized structures on manifolds (spin manifolds, framed manifolds, etc.)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Bishellable drawings of $K_n$, Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth, A note on the cross-index of a complete graph based on a linear tree, Extending Drawings of Complete Graphs into Arrangements of Pseudocircles, Closing in on Hill's Conjecture, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, Bounding the tripartite‐circle crossing number of complete tripartite graphs, From art and circuit design to geometry and combinatorics, 1-page and 2-page drawings with bounded number of crossings per edge, A contribution to Guy's conjecture, The crossing number of twisted graphs, Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\), The bipartite-cylindrical crossing number of the complete bipartite graph, On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page, Shellable drawings and the cylindrical crossing number of \(K_n\), The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of then-Cube, Topological Drawings of Complete Bipartite Graphs
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
