Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.01734 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917285292146688 |
|---|---|
| author | Liu, Wenzhong Zhang, Wangkai |
| author_facet | Liu, Wenzhong Zhang, Wangkai |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_01734 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The point-thicknesses of complete multipartite graphs Liu, Wenzhong Zhang, Wangkai Combinatorics 05C75, 05C10 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. |
| title | The point-thicknesses of complete multipartite graphs |
| topic | Combinatorics 05C75, 05C10 |
| url | https://arxiv.org/abs/2601.01734 |