Note on the Thickness of the Cartesian Product of a Complete Graph and a Path
Graphs and Combinatorics · 2026-12 · 42 (6)
DOI: 10.1007/s00373-026-03073-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 28.10.2026. Verfasst von Kenta Noguchi. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Japan Society for the Promotion of Science.
Abstract (Originalsprache)
We determine the thickness of the Cartesian product K6p+4□P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_{6p+4} \, \square \, P_2$$\end{document} for p≥0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p \ge 0$$\end{document} and of the Cartesian product K8□Pm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_8 \, \square \, P_m$$\end{document} for m≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m \ge 1$$\end{document}, where Kn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n$$\end{document} and Pm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_m$$\end{document} 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 Kn□P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n \, \square \, P_2$$\end{document} is completely determined.
Förderung
- Japan Society for the Promotion of Science
Zitieren
APA
Noguchi, K. (2026). Note on the Thickness of the Cartesian Product of a Complete Graph and a Path. Graphs and Combinatorics, 42(6). https://doi.org/10.1007/s00373-026-03073-1
Vancouver
Noguchi K. Note on the Thickness of the Cartesian Product of a Complete Graph and a Path. Graphs and Combinatorics. 2026;42(6). doi:10.1007/s00373-026-03073-1
BibTeX
@article{Noguchi2026,
author = {Noguchi, Kenta},
title = {Note on the Thickness of the Cartesian Product of a Complete Graph and a Path},
journal = {Graphs and Combinatorics},
year = {2026},
volume = {42},
number = {6},
doi = {10.1007/s00373-026-03073-1}
}
EUVIMED