The crossing number of K11 is 100
From MaRDI portal
Publication:5434249
DOI10.1002/jgt.20249zbMath1128.05018OpenAlexW1566173313WikidataQ57255583 ScholiaQ57255583MaRDI QIDQ5434249
Shengjun Pan, R. Bruce Richter
Publication date: 4 January 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20249
Related Items
Recent Advances in Exact Crossing Minimization (Extended Abstract), Bishellable drawings of $K_n$, On the Crossing Number of Kn without Computer Assistance, \(K_7\)-minors in optimal 1-planar graphs, The crossing number of locally twisted cubes \(L T Q_n\), Fan-crossing free graphs and their relationship to other beyond-planar graphs, The crossing number of \(K_{5,n+1} \setminus e\), Bounding the tripartite‐circle crossing number of complete tripartite graphs, From art and circuit design to geometry and combinatorics, Drawings of complete graphs in the projective plane, On the problems of CF-connected graphs, The early history of the brick factory problem, The crossing number of the Cartesian product of paths with complete graphs, On the crossing number of \(K_{13}\), Crossing number for graphs with bounded pathwidth, Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\), Unnamed Item, A note on the cross-index of a complete graph based on a linear tree, The crossing number of \(K_{1,m,n}\), Shellable drawings and the cylindrical crossing number of \(K_n\), A survey of graphs with known or bounded crossing numbers, The Crossing Number of Graphs: Theory and Computation, Closing in on Hill's Conjecture, Unnamed Item, An evolutionary formulation of the crossing number problem, An effective crossing minimisation heuristic based on star insertion, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, A contribution to Guy's conjecture, Empty triangles in good drawings of the complete graph, An upper bound for the crossing number of augmented cubes, On Numerical Invariant of Graph
