|
- 2018
K1,3,p和 K1,4,p的点可区别的IE-全染色及一般全染色
|
Abstract:
摘要: 利用色集事先分配法,构造染色法,反证法探讨了完全三部图K1,3,p和K1,4,p 的点可区别IE-全染色和点可区别一般全染色问题,确定了K1,3,p和K1,4,p的点可区别IE-全色数和点可区别一般全色数。
Abstract: The vertex-distinguishing IE-total coloring and vertex-distinguishing general total coloring of complete tripartite graphs K1,3,p and K1,4,pare discussed by distributing the color sets in advance,constructing the colorings and proving by contradiction. The vertex-distinguishing IE-total chromatic number and vertex-distinguishing general total chromatic number of K1,3,p and K1,4,p have been determined
[1] | HARARY F, PLANTHOLT M. “Conditional colorability in graphs,” in graphs and applications[M]. New York: John Wiley & Sons,1985. |
[2] | ZAGAGLIA-SALVI N. On the value of the point-distinguishing chromatic index of <i>K<sub>n,n</sub></i>[J]. Ars Combinatoria, 1990, 29B:235-244. |
[3] | LIU C, ZHU E. General Vertex-distinguishing total coloring of graphs[J]. Journal of Applied Mathematics, 2014, Article ID 849748, 7 pages.
</n)<></i> |
[4] | HORNAK M, SOTAK R. Localization jumps of the point-distinguishing chromatic index of <i>K<sub>n,n</sub></i>[J]. Discuss Math Graph Theory, 1997, 17:243-251. |
[5] | HORNAK M, SOTAK R. The fifth jump of the point-distinguishing chromatic index of <i>K<sub>n,n</sub></i>[J]. Ars Combinatoria, 1996, 42:233-242. |
[6] | CHEN Xiangen. Point-distinguishing chromatic index of the union of paths[J]. Czechoslovak Mathematical Journal, 2014, 64(3):629-640. |
[7] | CHEN Xiangen, GAO Yuping, YAO Bing. Vertex-distinguishing IE-total colorings of complete bipartite graphs <i>K<sub>m,n</sub>(m
<n)< i>
[J]. Discussiones Mathematicae Graph Theory, 2013, 33:289-306. |
[8] | HORNAK M, ZAGAGLIA-SALVI N. On the point-distinguishing chromatic index of <i>K<sub>m,n</sub></i>[J]. Ars Combinatoria, 2006, 80:75-85. |