No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles
type: Item
instance of: scholarly article
title: No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles
zbMATH Open document ID: 0851.05050
DOI: 10.1016/0166-218X(95)00108-4
author: David R. Guichard
published in: Discrete Applied Mathematics
publication date: 1996-11-21T00:00:00Z
review text: In [\textit{D. Sakai Troxell}, No-hole \(k\)-tuple \((r+1)\)-distant colorings, Discrete Appl. Math. 64, No. 1, 67-85 (1996; Zbl 0851.05049)] (see the review immediately preceding this one for definitions) it was shown that an odd cycle which has an \(\text{N}^k_r\)-coloring has a near-optimal one if \(k\leq 2(r+ 1)\). The present paper dispenses with the additional condition \(k\leq 2(r+ 1)\).
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 897355
reviewed by: Timothy R. S. Walsh
MaRDI profile type: Publication
cites work: Pair Labellings with Given Distance
cites work: The fractional chromatic number of mycielski's graphs
cites work: List \(T\)-colorings of graphs
cites work: No-hole \(k\)-tuple \((r+1)\)-distant colorings
full work available at URL: 0166-218x(95)00108-4
OpenAlex ID: W2008350443
Recommended article: No-hole \(k\)-tuple \((r+1)\)-distant colorings
Recommended article: No-hole \((r+1)\)-distant colorings
Recommended article: No-hole 2-distant colorings
Recommended article: Minimum span of no-hole \((r+1)\)-distant colorings
Recommended article: Chromatic numbers of distance graphs without short odd cycles in rational spaces
Recommended article: No-hole \(L(2,1)\)-colorings
Recommended article: Q5455714
Recommended article: On coloring the odd-distance graph
Recommended article: Q5461468
Recommended article: Q4552213
description: scientific article; zbMATH DE number 897355