The reviewed record of science sign in
Pith

arxiv: 2108.01032 · v2 · pith:ULRH26B4 · submitted 2021-08-02 · math.CO · cs.DM

The tripartite-circle crossing number of graphs with two small partition classes

Charles Camacho , Silvia Fern\'andez-Merchant , Marija Jeli\'c Milutinovi\'c , Rachel Kirsch , Linda Kleist , Elizabeth Bailey Matson , Jennifer White This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ULRH26B4record.jsonopen to challenge →

classification math.CO cs.DM
keywords tripartite-circlenumbercrossingcirclesdrawinggraphpartitiontripartite
0
0 comments X
read the original abstract

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 its tripartite-circle drawings. We determine the exact value of the tripartite-circle crossing number of $K_{a,b,n}$, where $a,b\leq 2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.