On the outerplanar crossing numbers of complete multipartite graphs
Abstract
We calculate the outerplanar crossing numbers of complete multipartite graphs which have n partite sets with m vertices and one partite set with p vertices, where either p|mn or mn|p.
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.