On the Number of Crossings in a Complete Graph

Cited in

(44)

The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
NETPAD: An interactive graphics system for network modeling and optimization
A contribution to Guy's conjecture
Approximating the bundled crossing number
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
Weighted Turán problems with applications
The 2-page crossing number of \(K_{n}\)
The early history of the brick factory problem
Shellable drawings and the cylindrical crossing number of \(K_n\)
An upper bound for the rectilinear crossing number of the complete graph
The crossing number of the cone of a graph
Topological Drawings of Complete Bipartite Graphs
On crossing numbers of complete tripartite and balanced complete multipartite graphs
Bishellable drawings of K_n
The crossing number of the cone of a graph
A note on the cross-index of a complete graph based on a linear tree
On the crossing number for Kronecker product of a tripartite graph with path
Extending drawings of complete graphs into arrangements of pseudocircles
Convex drawings of the complete graph: topology meets geometry
scientific article; zbMATH DE number 7587205 (Why is no real title available?)
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
A survey of graphs with known or bounded crossing numbers
Complexity of geometric \(k\)-planarity for fixed \(k\)
Closing in on Hill's conjecture
Simultaneous embeddings with few bends and crossings
Recent results in topological graph theory
scientific article; zbMATH DE number 3333192 (Why is no real title available?)
Bounding the tripartite‐circle crossing number of complete tripartite graphs
Approximating the Bundled Crossing Number
Drawings of complete graphs in the projective plane
On the problems of CF-connected graphs
Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
Bounding the tripartite-circle crossing number of complete tripartite graphs
The tripartite-circle crossing number of graphs with two small partition classes
Weights of convex quadrilaterals and empty triangles in weighted point sets
On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs
Associahedra minimize f-vectors of secondary polytopes of planar point sets
On the number of crossings in a random labeled tree
The crossing number of the complement of a circuit
On the crossing number of complete graphs
Abstract order type extension and new results on the rectilinear crossing number

This page was built for publication: On the Number of Crossings in a Complete Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5728983)