On the Number of Crossings in a Complete Graph
From MaRDI portal
Publication:5728983
DOI10.1017/S0013091500025645zbMath0118.18902OpenAlexW2109042433MaRDI QIDQ5728983
Publication date: 1963
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0013091500025645
Related Items
The Crossing Number of the Cone of a Graph, The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph, Bishellable drawings of $K_n$, Approximating the bundled crossing number, NETPAD: An interactive graphics system for network modeling and optimization, The 2-page crossing number of \(K_{n}\), The crossing number of twisted graphs, Abstract order type extension and new results on the rectilinear crossing number, Recent results in topological graph theory, Convex drawings of the complete graph: topology meets geometry, 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, The Crossing Number of the Cone of a Graph, Topological Drawings of Complete Bipartite Graphs, The early history of the brick factory problem, An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs, Unnamed Item, Complexity of Geometric k-Planarity for Fixed k, Unnamed Item, Simultaneous Embeddings with Few Bends and Crossings, Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\), 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, Shellable drawings and the cylindrical crossing number of \(K_n\), Unnamed Item, A survey of graphs with known or bounded crossing numbers, 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, The crossing number of the complement of a circuit, An upper bound for the rectilinear crossing number of the complete graph, Closing in on Hill's Conjecture, Weighted Turán problems with applications, Extending Drawings of Complete Graphs into Arrangements of Pseudocircles, A contribution to Guy's conjecture, On the crossing number of complete graphs
