crossing_number (468B)
1 # Crossing number 2 3 https://en.wikipedia.org/wiki/Crossing_number_(graph_theory) 4 5 Lowest number of [edge] crossings of a [plane_embedding] of an [undirected_graph]. 6 7 An [undirected_graph] is a [planar_graph] iff the crossing number is zero 8 9 [crossing_number_inequality] 10 11 The crossing number of [complete_bipartite_graphs] is an [open_problem], cf https://en.wikipedia.org/wiki/Tur%C3%A1n%27s_brick_factory_problem 12 13 Up: [planar_graph] 14 15 See also: [single_crossing_graph]