Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Charles Camacho , Silvia Fernández-Merchant , Marija Jelić Milutinović , Rachel Kirsch , Linda Kleist , Elizabeth Bailey Matson , Jennifer White This is my paper · ORCID
classification math.COcs.DM
keywords tripartite-circlenumbercrossingcirclesdrawinggraphpartitiontripartite
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Pith tools