| 王勇军,陈祥恩.Kn1,n2,n3,n4的点被多重集可区别的一般全染色(n1≤n2 |
| Kn1,n2,n3,n4的点被多重集可区别的一般全染色(n1≤n2 |
| General total colorings ofKn1,n2,n3,n4 with vertex distinguished by multisets(n1≤n2 |
| |
| DOI：10.7511/dllgxb202304014 |
| 中文关键词: 完全四部图 一般全染色 多重集 色集合 可区别 |
| 英文关键词: complete 4-partite graph general total coloring multisets color set distinguishing |
| 基金项目:国家自然科学基金资助项目(11761064). |
|
| 摘要点击次数: 117 |
| 全文下载次数: 177 |
| 中文摘要: |
| 图G的一般全染色是指使用若干种元素对于图G的全体点及边的一个分配．通常情况下，染色时所用的k种颜色用1，2，…，k来表示，且数字代表的颜色之间有大小关系．图G使用了k种颜色的一般全染色叫作图G的k-一般全染色．利用反证法、构造染色法及色集合事先分配法，讨论了完全四部图Kn1，n2，n3，n4(n1≤n2 |
| 英文摘要: |
| A general total coloring of graph G is a distribution of all vertices and edges of graph G using several elements. Usually, during coloring, the kcolors used are denoted by 1, 2, …, k, and there is a size relationship between the colors represented by the numbers. A general total coloring of graph G using kcolors is called k-general total coloring of graph G. By using the method of contradiction, the method of constructing concrete coloring and the method of distributing the color sets in advance, the general total colorings are discussed for complete 4-partite graph Kn1,n2,n3,n4(n1≤n2 |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
|
|
|