An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

DOI10.7155/jgaa.00540zbMath1447.05140arXiv1907.07796OpenAlexW3045189200MaRDI QIDQ5119386

Frank Duque, Oscar E. García-Quintero, Carlos Hidalgo-Toscano, Oswin Aichholzer, Ruy Fabila-Monroy

Publication date: 4 September 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.07796

zbMATH Keywords

pseudolinear crossing numberpseudolinear drawing of a graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Maximum rectilinear crossing number of uniform hypergraphs ⋮ Counting the number of crossings in geometric graphs ⋮ On compatible matchings

Cites Work

• On the crossing number of complete graphs
• Geometric drawings of \(K_{n}\) with few crossings
• 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
• The graph crossing number and its variants: a survey
• An upper bound for the rectilinear crossing number of the complete graph
• The Rectilinear Crossing Number of K n : Closing in (or Are We?)
• A central approach to bound the number of crossings in a generalized configuration
• Computational search of small point sets with small rectilinear crossing number
• On the Number of Crossings in a Complete Graph

This page was built for publication: An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants