Note on the Thickness of the Cartesian Product of a Complete Graph and a Path
We determine the thickness of the Cartesian product $$K_{6p+4} \, \square \, P_2$$ for $$p \ge 0$$ and of the Cartesian product $$K_8 \, \square \, P_m$$ for $$m \ge 1$$ , where $$K_n$$ and $$P_m$$ denote the complete graph on n vertices and the path on m vertices, respectively. These are two of the three remaining cases from the results of Chen, Kohonen, and Yang [6]. Combined with their results, the thickness of $$K_n \, \square \, P_2$$ is completely determined.
Authors
- Kenta Noguchi
Institutions
- Tokyo University of Science (JP)
Publication Details
- Journal
- Graphs and Combinatorics
- Published
- 2026-10-28
- DOI
- https://doi.org/10.1007/s00373-026-03073-1
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00