Limiting Crossing Numbers for Geodesic Drawings on the Sphere
From MaRDI portal
Publication:5014128
DOI10.1007/978-3-030-68766-3_27OpenAlexW3134791307MaRDI QIDQ5014128FDOQ5014128
Authors: Marthe Bonamy, Bojan Mohar, Alexandra Wesolek 
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.10459
Recommendations
- Geometric drawings of \(K_{n}\) with few crossings
- Drawings of graphs on surfaces with few crossings
- Counting the number of crossings in geometric graphs
- On crossing numbers of geometric proximity graphs
- Bounds for rectilinear crossing numbers
- scientific article; zbMATH DE number 6438460
- Approximating the rectilinear crossing number
- Approximating the rectilinear crossing number
- Some results on geodetic number of graphs
- Bounds for Convex Crossing Numbers
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Limits of dense graph sequences
- Large networks and graph limits
- Graph theory
- Generalized quasirandom graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Graph theory
- Crossing numbers of graphs
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- On a problem of P. Turan concerning graphs
- From the Buffon Needle Problem to the Kreiss Matrix Theorem
- The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
- On the Distribution of Crossings in Random Complete Graphs
This page was built for publication: Limiting Crossing Numbers for Geodesic Drawings on the Sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014128)
