Vertex-distinguishing total coloring of mC<sub>6</sub>

您当前的位置：

首页 >

文章列表页 >

Vertex-distinguishing total coloring of mC₆

更新时间：2023-12-11

- Vertex-distinguishing total coloring of mC₆
- Acta Scientiarum Naturalium Universitatis SunYatseni Vol. 57, Issue 1, Pages: 69-75(2018)
- 作者机构：
  
  1. 西北师范大学数学与统计学院,甘肃,兰州,730070
  2. 
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2018，
  
  Published Online：25 January 2018，
扫描看全文
HE Yuping, WANG Zhiwen, CHEN Xiang’en. Vertex-distinguishing total coloring of mC₆. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 57(1):69-75(2018)
DOI：

HE Yuping, WANG Zhiwen, CHEN Xiang’en. Vertex-distinguishing total coloring of mC₆. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 57(1):69-75(2018) DOI：

讨论了m个长为6的圈的点不交的并的mC

点可区别全染色，并且确定了mC

的点可区别全色数。结论表明VDTC 猜想对于图mC

是成立的。

The vertex-distinguishing total colorings of the disjoint union mC

of m cycles of length 6 are studied and the vertex-distinguishing total chromatic number of mC

is determined. The result shows that the VDTC conjecture is valid for mC

圈不交并点可区别全染色点可区别全色数

cyclethe disjoint unionvertex-distinguishing total coloringvertex-distinguishing total chromatic number

Views

282

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The Graceful Labeling of the Graph S(4m+1,4(t+1),4m－1) Based on the Balanced Labeling of the Path P_8m+4t+2

Related Author

WU Yuesheng

Related Institution

School of Science, East China Jiaotong University

Postal code：510275
Tel：020-84112585，84113223 Email：xuebaozr@mail.sysu.edu.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09064830号-19 京公网安备11010802024621
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰

Vertex-distinguishing total coloring of mC6