扭立方体图的全色数和邻点可区别全色数

陈美润

doi:10.13568/j.cnki.651094.2017.01.005

您当前的位置：

首页 >

文章列表页 >

扭立方体图的全色数和邻点可区别全色数

更新时间：2026-01-21

- 扭立方体图的全色数和邻点可区别全色数
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 34, Issue 1, Pages: 23-27(2017)
- 作者机构：
  
  厦门理工学院应用数学学院
- 作者简介：
- 基金信息：
- DOI：10.13568/j.cnki.651094.2017.01.005
  CLC： O157.5
- Published：2017
- 稿件说明：
移动端阅览
[1]陈美润.扭立方体图的全色数和邻点可区别全色数[J].新疆大学学报(自然科学版),2017,34(01):23-27.
[1]陈美润.扭立方体图的全色数和邻点可区别全色数[J].新疆大学学报(自然科学版),2017,34(01):23-27. DOI： 10.13568/j.cnki.651094.2017.01.005.

DOI：10.13568/j.cnki.651094.2017.01.005.

摘要

本文研究扭立方体图的全色数和邻点可区别全色数

确定了他们的精确值.通过这两个参数的值说明扭立方体图满足著名的全染色猜想(TCC)和邻点可区别全染色猜想.

Abstract

We verify two conjectures(the famous total coloring conjecture and the more recent adjacent vertex-distinguishing total coloring conjecture) for the class of twisted cubes by explicit calculation of the respective parameters.

关键词

Keywords

references

Behzad Mehdi.Graphs and their chromatic numbers[D].East Lansing:Michigan State University,1965.

Vizing Vadim Georgievich.Some unsolved problems in graph theory[J].Uspekhi Mat Nauk,1968,23:117-134.

Zhang Zhongfu,Chen Xiang’en,Li Jingwen.On the adjacent vertex-distinguishing total coloring of graphs[J].Science in China Ser A Mathematics,2005,48:289-299.

Chen Meirun,Guo Xiaofeng,Li Hao,et al.Total chromatic number of generalized Mycielski graphs[J].Discrete Mathematics,2014,334:48-51.

Chen Meirun,Zhai Shaohui.Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes[J].Ars Combinatorics,2014,114:87-96.

Huang Wentzeng,Tan Jimmy,Hung Chunnan,et al.Fault-tolerant hamiltoncity of twisted cubes[J].Journal of Parallel and Distributed Computing,2002,62:591-604.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰