Guichard-Combinatorics-Graph-Theory · Problem 1.1.10
Fundamentals
Mathematics — Probability · graph-theory-drawings
Problem
The complete bipartite graph K3,3 consists of two groups of three vertices each, with all possible edges between the groups and no other edges. Draw this graph with only one crossing.