The circular k-partite crossing number of Km,n
Abstract
We define a new kind of crossing number which generalizes both the bipartite crossing number and the outerplanar crossing number. We calculate exact values of this crossing number for many complete bipartite graphs and also give a lower bound.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.