Construction of crossing-critical graphs (Q1088998)

A graph is crossing-critical if deleting any edge decreases its crossing number on the plane. For any \(n\geq 2\) the author presents a construction of an infinite family of 3-connected crossing-critical graphs with crossing number n. Since no parallel edges are used in the construction, this result generalizes an earlier one of the reviewer in Discrete Math. 48, 129-132 (1984; Zbl 0535.05026)].