The Tripartite-Circle Crossing Number of K_2,2,n

08/02/2021

∙

by   Charles Camacho, et al.

∙

0

∙

share

A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of a tripartite graph is the minimum number of edge crossings among all tripartite-circle drawings. We determine the tripartite-circle crossing number of K_2,2,n.