| K4-minor-free图的邻点可区别全染色 |
| |
| 引用本文： | 史小艺,张宁,万慧敏.K4-minor-free图的邻点可区别全染色[J].五邑大学学报(自然科学版),2012(4):9-13. |
| |
| 作者姓名： | 史小艺 张宁 万慧敏 |
| |
| 作者单位： | 中国矿业大学理学院,江苏徐州221008 |
| |
| 基金项目： | 中央高校基本科研业务费专项基金资助项目（2010LKSX06） |
| |
| 摘 要： | 图G的一个正常全染色被称为邻点可区别全染色,如果G中任意两个相邻点的色集合不同.论文确定了k4-minor-free图的邻点可区别全色数.
|
| 关 键 词： | 全染色 邻点可区别全染色 邻点可区别全色数 k4-minor-free图 |
Adjacent Vertex Distinguishing Total Coloring of k4-minOr-free Graphs |
| |
| SHI Xiao-yi,ZHANG Ning,WAN Hui-min.Adjacent Vertex Distinguishing Total Coloring of k4-minOr-free Graphs[J].Journal of Wuyi University(Natural Science Edition),2012(4):9-13. |
| |
| Authors: | SHI Xiao-yi ZHANG Ning WAN Hui-min |
| |
| Institution: | (College of Science, China University of Mining ＆ Technology, Xuzhou 221008, China) |
| |
| Abstract: | A proper total coloring of graph G is called adjacent vertex distinguishing if the color sets of every two adjacent vertices are different. The paper determines the adjacent vertex distinguishing total chromatic numbers of k4 -minor-free graphs. |
| |
| Keywords: | total coloring adjacent vertex distinguishing total coloring adjacent vertex distinguishing total chromatic number k4 -minor-free graphs |
| 本文献已被 CNKI 维普 等数据库收录！ |
