mC12的点被多重集可区别的I-全染色和VI-全染色
I-Total Coloring and VI-Total Coloring of mC12 Which Are Vertex-Distinguishing by Multiple Sets
DOI: 10.12677/pm.2024.144150, PDF,   
作者: 王 辰：西北师范大学数学与统计学院，甘肃 兰州
关键词: mC12；I-全染色；VI-全染色；多重集；色集合；点可区别；mC12； I-Total Coloring； VI-Total Coloring； Multi-Set； Color Set； Vertex-Distinguishing
摘要: 通过构造以多重色集合和空集为元素的矩阵，应用组合分析法及构造具体染色的方法，得到了mC12的点被多重色集合可区别的I-全染色和VI-全染色的全色数及最优染色方案。
Abstract: By constructing matrix with multi color sets and empty sets as elements, using the methods of combinatorial analysis and describing coloring explicitly, we obtain the total chromatic number of I-total coloring and VI-total coloring of mC12 which are vertex­distinguishing by multiple sets and determine strategy of the optimal coloring.
文章引用：王辰. mC12的点被多重集可区别的I-全染色和VI-全染色[J]. 理论数学, 2024, 14(4): 422-439. https://doi.org/10.12677/pm.2024.144150

参考文献

[1] Burris, A.C. (1993) Vertex-Distinguishing Edge-Colorings. PhD Thesis, Memphis State University, Memphis.
[2] Burris, A.C. and Schelp, R.H. (1997) Vertex-Distinguishing Proper Edge-Colorings. Journal of Graph Theory, 26, 73-82. [Google Scholar] [CrossRef] 
[3] Balister, P.N., Riordan, O.M. and Schelp, R.H. (2003) Vertex-Distinguishing Edge Colorings of Graphs. Journal of Graph Theory, 42, 95-109. [Google Scholar] [CrossRef] 
[4] Horňák, M. and Soták, R. (1996) The Fifth Jump of the Point-Distinguishing Chromatic Index of . Ars Combinatoria, 42, 233-242.
[5] Horňák, M. and Soták, R. (1997) Localization of Jumps of the Point-Distinguishing Chromatic Index of . Discussiones Mathematicae Graph Theory, 17, 243-251. [Google Scholar] [CrossRef] 
[6] Horňák, M. and Salvi, N.Z. (2006) On the Point-Distinguishing Chromatic Index of Complete Bipartite Graphs. Ars Combinatoria, 80, 75-85.
[7] Salvi, N.Z. (1990) On the Value of the Point-Distinguishing Chromatic Index of . Ars Combinatoria, 29B, 235-244.
[8] Zhang, Z.F., Qiu, P.X., Xu, B.G., et al. (2008) Vertex-Distinguishing Total Coloring of Graphs. Ars Combinatoria, 87, 33-45.
[9] Chen, X.E. and Li, Z.P. (2014) Vertex-Distinguishing I-Total Colorings of Graphs. Utilitas Mathematica, 95, 319-327.
[10] 陈祥恩, 苗婷婷, 王治文. 两条路的联图的点可区别I-全染色[J]. 山东大学学报(理学版), 2017, 52(4): 30-33.
[11] 苗婷婷, 王治文, 陈祥恩. 圈与路联图点可区别I-全染色和点可区别VI-全染色[J]. 大连理工大学学报, 2017, 57(4): 430-435.
[12] 杨晗, 陈祥恩. m个阶为4的圈的不交并的点可区别I-全染色和VI-全染色[J]. 厦门大学学报(自然科学版), 2020, 59(1): 85-89.
[13] 陈祥恩. 某些顶点对被非多重色集合所区别的未必正常染色的综述[J]. 广州大学学报(自然科学版), 2019, 18(4): 50-59.

为你推荐