Some theorems concerning the star chromatic number of a graph
type: Item
instance of: scholarly article
title: Some theorems concerning the star chromatic number of a graph
zbMATH Open document ID: 0880.05042
author: Bing Zhou
published in: Journal of Combinatorial Theory. Series B
publication date: 1997-08-12T00:00:00Z
review text: Let \(d\) be a positive integer satisfying \(m\geq 2d\). An \((m,d)\)-colouring of a graph \(G\) is a function \(f:V\to Z_m\) such that \(|f(u)- f(v)|_m\geq d\) for each edge \(uv\). The star-chromatic number of \(G\) is defined as \(\inf\{m/d: G\) has an \((m,d)\)-colouring\}. The author investgates the star-chromatic number of a graph via the chromatic number, girth, independence number, length of a longest cycle of the graph, respectively.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1042497
zbMATH Keywords: star-chromatic number
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
full work available at URL: jctb.1996.1738
OpenAlex ID: W1990891573
cites work: The star chromatic number of a graph
cites work: A note on the star chromatic number
cites work: Graph Theory and Probability
cites work: Acyclic graph coloring and the complexity of the star chromatic number
cites work: A hypergraph-free construction of highly chromatic graphs without short cycles
cites work: On chromatic number of finite set-systems
cites work: A short proof of the existence of highly chromatic hypergraphs without short cycles
cites work: Q5601345
cites work: Star chromatic numbers of graphs
cites work: Star chromatic number
cites work: Q3033781
cites work: Star chromatic numbers and products of graphs
DOI: 10.1006/JCTB.1996.1738
description: scientific article; zbMATH DE number 1042497