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.
Fields of Study & Subjects
Advanced Graph Theory Research
Limits and Structures in Graph Theory
Computational Geometry and Mesh Generation
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 5 January 2026
- Document type
- Preprint