路和完全图的乘积图的广义染色数
The Generalized Coloring Number of Product Graph of Path and Complete Graph
DOI: 10.12677/aam.2025.143107, PDF,   
作者: 李达磊：浙江师范大学数学科学学院，浙江 金华
关键词: 笛卡尔积；直积；强积；广义染色数；The Cartesian Product； The Direct Product； The Strong Product； Generalized Coloring Number
摘要: 本文讨论的是路与完全图的乘积图，我们给出了路与完全图的乘积图的一个线性序，并且在该线性序下分别给出了路与完全图的直积图、笛卡尔积图以及强积图的广义染色数上界。
Abstract: This article discusses the product graph of a path and complete graph. We provide a linear order for the product graph of a path and complete graph, and under this linear order, we respectively give the upper bounds on the generalized coloring number of the direct product graph, Cartesian product graph and strong product graph of the path and complete graph.
文章引用：李达磊. 路和完全图的乘积图的广义染色数[J]. 应用数学进展, 2025, 14(3): 216-219. https://doi.org/10.12677/aam.2025.143107

参考文献

[1] Kierstead, H.A. and Yang, D. (2003) Orderings on Graphs and Game Coloring Number. Order, 20, 255-264. [Google Scholar] [CrossRef] 
[2] Dujmović, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T. and Wood, D.R. (2020) Planar Graphs Have Bounded Queue-Number. Journal of the ACM, 67, 1-38. [Google Scholar] [CrossRef] 
[3] 刘佳丽. 树和路的乘积图的广义染色数及博弈染色数[J]. 应用数学进展, 2022, 11(1): 318-325. [Google Scholar] [CrossRef] 

为你推荐