The circular chromatic number of induced subgraphs
type: Item
instance of: scholarly article
title: The circular chromatic number of induced subgraphs
zbMATH Open document ID: 1054.05042
published in: Journal of Combinatorial Theory. Series B
publication date: 2004-10-01T00:00:00Z
review text: For positive integers \(d\) and \(k\), \(k\geq 2d\), a \((k, d)\)-coloring of a graph \(G\) is a mapping \(f: V(G) \rightarrow \{0, \dots, k-1\}\) such that, for every adjacent vertices \(x, y\) of \(G\), \(d\leq | f(x) - f(y)| \leq k - d\). The circular chromatic number of \(G\) is \(\chi_c(G) =\min\{\frac{k}{d} : G \text{ admits a }(k, d)\)-coloring
reviewed by: Van Bang Le
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 2104556
zbMATH Keywords: circular chromatic number
author: Xuding Zhu
MaRDI profile type: Publication
full work available at URL: j.jctb.2004.03.007
OpenAlex ID: W2078475586
cites work: A note on the star chromatic number
cites work: Coloring-flow duality of embedded graphs
cites work: On (k,d)-colorings and fractional nowhere-zero flows
cites work: Circular chromatic number of subgraphs
cites work: Star chromatic number
cites work: Some theorems concerning the star chromatic number of a graph
cites work: Star chromatic numbers and products of graphs
cites work: Circular chromatic number: A survey
DOI: 10.1016/J.JCTB.2004.03.007
description: scientific article; zbMATH DE number 2104556