On the 2-colored crossing number

DOI10.1007/978-3-030-35802-0_7OpenAlexW2990902058MaRDI QIDQ2206834

Carlos Hidalgo-Toscano, Francisco Zaragoza, Irene Parada, Ruy Fabila-Monroy, Birgit Vogtenhuber, Adrian Fuchs, Oswin Aichholzer

Publication date: 26 October 2020

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

zbMATH Keywords

rectilinear crossing numbercomplete graph\(k\)-colored crossing number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Parameterized analysis and crossing minimization problems ⋮ The crossing numbers of join products of four graphs of order five with paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric drawings of \(K_{n}\) with few crossings
• Abstract order type extension and new results on the rectilinear crossing number
• On \(k\)-planar crossing numbers
• A positive fraction Erdős-Szekeres theorem
• Note on \(k\)-planar crossing numbers
• The graph crossing number and its variants: a survey
• On the Pseudolinear Crossing Number
• Crossing Number is NP-Complete
• A central approach to bound the number of crossings in a generalized configuration
• Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Computational search of small point sets with small rectilinear crossing number
• The Non-Biplanar Character of the Complete 9-Graph
• Every planar graph with nine points has a nonplanar complement

This page was built for publication: On the 2-colored crossing number