|
|
路和完全图的乘积图的广义染色数
|
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.
| [1] | Kierstead, H.A. and Yang, D. (2003) Orderings on Graphs and Game Coloring Number. Order, 20, 255-264. https://doi.org/10.1023/B:ORDE.0000026489.93166.cb |
| [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. https://doi.org/10.1145/3385731 |
| [3] | 刘佳丽. 树和路的乘积图的广义染色数及博弈染色数[J]. 应用数学进展, 2022, 11(1): 318-325. https://doi.org/10.12677/AAM.2022.111039 |
