| 图的邻点可区别全染色的渐近性质 |
| |
| 引用本文： | 晁福刚,强会英,盛秀艳.图的邻点可区别全染色的渐近性质[J].数学的实践与认识,2014(1). |
| |
| 作者姓名： | 晁福刚 强会英 盛秀艳 |
| |
| 作者单位： | 华东师范大学数学系;兰州交通大学应用数学研究所;聊城大学数学科学学院; |
| |
| 基金项目： | 国家自然科学基金(11171114) |
| |
| 摘 要： | 图G的一个正常全染色被称为邻点可区别全染色,如果G中任意两个相邻点的色集合不同,其所用的最少颜色数称为邻点可区别全色数.张忠辅老师猜想:对于|V(G)|≥3的连通图G,其邻点可区别全色数最多不超过△(G)+3.用概率方法证明了对简单图G,△≥14,有χ_(at)(G)≤△+C,其中C≥10~(26)+1.
|
| 关 键 词： | 邻点可区别全染色 邻点可区别全色数 Lovasz局部引理 |
Asymptotic Behavior of the Adjacent Vertex Distinguishing Total Coloring of Graphs |
| |
| Abstract: | A proper k—total coloring is called adjacent vertex distinguishing total coloring if any two adjacent vertices have different color sets.The least number of colours required for a adjacent vertex distinguishing total coloring is called adjacent vertex distinguishing total chromatic number.Zhang conjectured that,for connected graph,the adjacent vertex distinguishing total chromatic number is at most △(G)+3.In this paper,using the probablistic methods,we prove that for any simple graph G,△≥ 14,then X_(at)(G) ≤ A + C,where C ≥ 10~(26) + 1. |
| |
| Keywords: | adjacent vertex distinguishing total coloring adjacent vertex distinguishing total chromatic number the Lovasz local lemma |
| 本文献已被 CNKI 等数据库收录！ |
|
