Publication:4888117
From MaRDI portal
DOI<239::AID-JGT4>3.0.CO;2-N 10.1002/(SICI)1097-0118(199607)22:3<239::AID-JGT4>3.0.CO;2-NzbMath0854.05036MaRDI QIDQ4888117
Marián Klešč, R. Bruce Richter, Ian Stobert
Publication date: 15 October 1996
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Unnamed Item, General lower bounds for the minor crossing number of graphs, The crossing numbers of products of 5-vertex graphs with cycles, Drawings of \(C_m\times C_n\) with one disjoint family, A successful concept for measuring non-planarity of graphs: The crossing number., Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\)., Drawings of \(C_m\times C_n\) with one disjoint family. II, The crossing number of \(K_{1,4,n}\), Crossing number is hard for cubic graphs