完全二部图K5,n(n ≥ 7114)的点被多重集可区别的E-全染色
E-Total Coloring of Complete Bipartite Graphs K5,n(n ≥ 7114) Which Are Vertex-Distinguished by Multiple Sets
摘要: 利用反证法、色集合事先分配法以及构造具体染色等方法，探讨了完全二部图K
5,n(n ≥ 7114)的点被多重集可区别的E-全染色，确定了这一类图的点被多重集可区别的E-全色数。
Abstract:
In this paper, the E-total coloring of complete bipartite graphs K5,n(n ≥ 7114) which are vertex-distinguished by multiple sets is discussed by using the method of contradiction, the method of pre-assignment of chromatic sets and the method of constructing specific coloring, we determined E-total chromatic numbers of K5;n which are vertex-
distinguished by multiple sets.
参考文献
|
[1]
|
Zhang, Z.F., Qiu, P.X., Li, J.W., et al. (2008) Vertex-Distinguishing Total Coloring of Graphs.
Ars Combinatoria, 87, 33-45.
|
|
[2]
|
Burris, A.C. and Schelp, R.H. (1997) Vertex-Distinguishing Proper Edge-Colorings. Journal
of Graph Theory, 26, 73-82.
https://doi.org/10.1002/(sici)1097-0118(199710)26:2h73::aid-jgt2i3.0.co;2-c
|
|
[3]
|
Liu, C. and Zhu, E. (2014) General Vertex-Distinguishing Total Coloring of Graphs. Journal
of Applied Mathematics, 2014, 1-7.
https://doi.org/10.1155/2014/849748
|
|
[4]
|
Chen, X., Zu, Y., Xu, J., Wang, Z. and Yao, B. (2011) Vertex-Distinguishing E-Total Colorings
of Graphs. Arabian Journal for Science and Engineering, 36, 1485-1500.
https://doi.org/10.1007/s13369-011-0099-8
|
|
[5]
|
李世玲,陈祥恩,王治文.完全二部图K3,n(3≤n≤17)的点可区别E-全染色[J]. 吉林大学学报(理学版)，2015,53(6):1171-1176.
|
|
[6]
|
师志凤,陈祥恩,王治文.完全二部图K6,n(6≤n≤38)的点可区别E-全染色[J]. 吉林大学学报(理学版)，2018,56(4):845-852.
|
|
[7]
|
包丽娅,陈祥恩,王治文.完全二部图K10,n(10≤n≤90)的点可区别E-全染色[J]. 山东大学学报(理学版)，2018,53(12):23-30.
|
|
[8]
|
杨伟光,陈祥恩.完全二部图K9,n(9≤n≤92)的点可区别E-全染色[J]. 吉林大学学报(理学版),2020.58(2):301-308.
|
|
[9]
|
陈祥恩.某些顶点对被非多重色集合所区别的未必正常染色的综述[J]. 广州大学学报(自然科学版)，2019，18(4):50-59.
|
|
[10]
|
曹静,陈祥恩.轮与扇的点被多重集可区别的E-全染色[J]. 山东大学学报(理学版),2024,59(2):38-46.
|
|
[11]
|
邵嘉裕.组合数学[M]. 上海:同济大学出版社,1991.
|