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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Note on the Thickness of the Cartesian Product of a Complete Graph and a Path

Kenta Noguchi
Graphs and Combinatorics
Advanced Graph Theory Research
article

Note on the Thickness of the Cartesian Product of a Complete Graph and a Path

Kenta Noguchi
article en

Abstract

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.

Graphs and CombinatoricsVol. 42(6)
Tokyo University of Science (JP)
Openalex Percentile: Top 78%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Note on the Thickness of the Cartesian Product of a Complete Graph and a Path — Kenta Noguchi · Graphs and Combinatorics (2026) | TGRS Research Map | TGRS