Note on the thickness of the Cartesian product of a complete graph and a path
Combinatorics
2026-03-31 v1
Abstract
We determine the thickness of the Cartesian product for and of the Cartesian product for , where and denote the complete graph on vertices and the path on vertices, respectively.
Cite
@article{arxiv.2603.27968,
title = {Note on the thickness of the Cartesian product of a complete graph and a path},
author = {Kenta Noguchi},
journal= {arXiv preprint arXiv:2603.27968},
year = {2026}
}
Comments
6 pages, 2 figures