Circular chromatic numbers of a class of distance graphs
type: Item
instance of: scholarly article
title: Circular chromatic numbers of a class of distance graphs
zbMATH Open document ID: 1021.05040
DOI: 10.1016/S0012-365X(02)00631-3
published in: Discrete Mathematics
publication date: 2003-05-25T00:00:00Z
review text: For positive integers \(m\), \(k\), \(s\) with \(m\geq sk\) let \(D_{m,k,s}\) denote the set \(\{1,2,\dots, m\}\setminus\{k,2k,\dots, sk\}\). The distance graph has as vertices all integers and as edges the pairs \(i\), \(j\) with \(|i-j|\in D_{m,k,s}\). The author determines the circular chromatic number (a generalization of the star chromatic number) of all the distance graphs.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1915551
zbMATH Keywords: circular chromatic number
zbMATH Keywords: star chromatic number
zbMATH Keywords: distance graph
author: Xuding Zhu
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1915551