On the crossing number of some complete multipartite graphs
Abstract
In this paper, we find the crossing number of the complete multipartite graphs K1,1,1,1,n, K1,2,2,n, K1,1,1,2,n and K1,4,n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.