Distant vertex partitions of graphs

被引：2
|
作者：
Jagger, C [1 ]
机构：
[1] Dept Pure Math & Math Stat, Cambridge CB2 1SB, England
来源：
COMBINATORICS PROBABILITY & COMPUTING | 1998年 / 7卷 / 04期
关键词：
D O I：
10.1017/S0963548398003654
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the function chi(G(k)), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for the cases k = 2 and k = 3.
引用
收藏
页码：413 / 422
页数：10
相关论文
共 50 条
12345