首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的各种一般全染色
引用本文:陈祥恩,高毓平,杨随义.图的各种一般全染色[J].吉首大学学报(自然科学版),2011,32(1):1-3.
作者姓名:陈祥恩  高毓平  杨随义
作者单位:(1.西北师范大学数学与信息科学学院,甘肃 兰州730070;2.天水师范学院数学与统计学院,甘肃 天水741001)
基金项目:National Natural Science Foundation of China(10771091)
摘    要:图G的正常全染色是指若干颜色给G的顶点和边的分配,使任意2个相邻顶点、2条相邻边和任一顶点与它的关联边得到的颜色不同.将正常全染色的限制条件减弱,得到了各种一般全染色,并讨论了它们的色数.

关 键 词:全染色  色数  边色数  

Various General Total Colorings of Graphs
CHEN Xiang-en,GAO Yu-ping,YANG Sui-yi.Various General Total Colorings of Graphs[J].Journal of Jishou University(Natural Science Edition),2011,32(1):1-3.
Authors:CHEN Xiang-en  GAO Yu-ping  YANG Sui-yi
Institution:(1.College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China; 2.School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,Gansu China)
Abstract:A proper total coloring of a graph G is an assignment of colors to the edges and vertices of G in such a way that no two adjacent vertices,no two adjacent edges,and no incident vertex and edge receive the same color.In this paper,the authors weaken the constraints of the proper total coloring to obtain several general total colorings and discuss their chromatic numbers.
Keywords:total coloring  chromatic number  edge chromatic index  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《吉首大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号