A Note on Star Chromatic Number of Graphs

被引：0

作者：

Hong Yong FU1

2.College of Economics and Business Administration

机构：

来源：

Journal of Mathematical Research with Applications | 2010年 / 05期

关键词：

star coloring; star chromatic number; proper coloring;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

A star coloring of an undirected graph G is a proper coloring of G such that no path of length 3 in G is bicolored.The star chromatic number of an undirected graph G,denoted by χs(G),is the smallest integer k for which G admits a star coloring with k colors.In this paper,we show that if G is a graph with maximum degree △,then χs(G) ≤ [7△3/2],which gets better bound than those of Fertin,Raspaud and Reed.

引用

页码：841 / 844

页数：4