Planar graphs with circular chromatic numbers between 3 and 4
type: Item
instance of: scholarly article
title: Planar graphs with circular chromatic numbers between 3 and 4
zbMATH Open document ID: 0933.05053
author: Xuding Zhu
published in: Journal of Combinatorial Theory. Series B
publication date: 1999-12-20T00:00:00Z
review text: This paper proves that for every rational number \(r\) between 3 and 4, there exists a planar graph \(G\) whose circular chromatic number is equal to \(r\). Combining this result with a recent result of Moser, we arrive at the conclusion that every rational number \(r\) between 2 and 4 is the circular chromatic number of a planar graph. \(\copyright\) Academic Press.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1346958
zbMATH Keywords: planar graph
zbMATH Keywords: circular chromatic number
MaRDI profile type: Publication
full work available at URL: jctb.1999.1900
OpenAlex ID: W2004002579
cites work: A note on the star chromatic number
cites work: Circular chromatic numbers of Mycielski's graphs
cites work: Circular chromatic numbers and fractional chromatic numbers of distance graphs
cites work: Q4342632
cites work: Acyclic graph coloring and the complexity of the star chromatic number
cites work: Q4944681
cites work: On (k,d)-colorings and fractional nowhere-zero flows
cites work: The star-chromatic number of planar graphs
cites work: Q4001741
cites work: Star chromatic numbers of graphs
cites work: Star chromatic number
cites work: Graphs whose circular chromatic number equals the chromatic number
cites work: Star chromatic numbers and products of graphs
cites work: A simple proof of Moser's theorem
cites work: Q4256101
cites work: Circular colouring and graph homomorphism
DOI: 10.1006/JCTB.1999.1900
description: scientific article; zbMATH DE number 1346958