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

特殊图的条件染色
引用本文:刘晓晓,陈丽华,张姗姗.特殊图的条件染色[J].山东科学,2008,21(3):9-12.
作者姓名:刘晓晓  陈丽华  张姗姗
作者单位:山东师范大学数学科学学院,山东,济南,250014
摘    要:对于一个正整数r,图G的一个条件(k,r)-染色是使得图G的每个度至少为r的顶点至少与具有r种不同颜色的顶点相邻的正常的顶点染色.使图有一个条件(k,r)-染色的最小的整数k是图的第r个条件色数Z,(G),本文给出了对于不同的正整数,路、扇、轮的条件色数。

关 键 词:条件色数      

The Conditional Chromatic Numbers of Special Graphs
LIU Xiao-xiao,CHEN Li-hua,ZHANG Shan-shan.The Conditional Chromatic Numbers of Special Graphs[J].Shandong Science,2008,21(3):9-12.
Authors:LIU Xiao-xiao  CHEN Li-hua  ZHANG Shan-shan
Institution:( School of Mathematics, Shandong Normal University, Jinan 250014, China )
Abstract:For a integer r 〉 0, a conditional (k, r)-coloring of a graph is a proper k-coloring of the vertices of G whose every vertex of degree at least r is in G will be adjecent to vertices with at least r different colors.The smallest interger k for which a graph G has a conditional( k, r)-coloring is the rth order conditional chromatic number Z, (G). In this paper, the conditional chromatic mumbers of path, wheel, fan are presented.
Keywords:conditional chromatic number  path  wheel  fan
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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