3 citations · 8 across the 9 of their papers we have counts for
1 paper · 1 filter
Drago Bokal, Bogdan Oporowski, R. Bruce Richter +1
It is very well-known that there are precisely two minimal non-planar graphs: K5 and K3,3 (degree 2 vertices being irrelevant in this context). In the language of crossing…