The point-thicknesses of complete multipartite graphs
Abstract
The point-thickness θ'(G) of a graph G is the minimum number of subsets into which the vertex set V(G) of G is partitioned such that each subset induces a planar subgraph. In this paper, we determine the point-thickness of complete multipartite graphs. As a special case, we also obtain the point-thickness of complete graphs.
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.