Construction of sparse graphs with prescribed circular colorings

DOI10.1016/S0012-365X(00)00246-6zbMath0982.05048OpenAlexW2051131143MaRDI QIDQ5936037

Jaroslav Nešetřil, Xuding Zhu

Publication date: 27 February 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00246-6

zbMATH Keywords

circular chromatic numberhomomorphismgirth\((k,d)\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems ⋮ On the adaptable chromatic number of graphs ⋮ On sparse graphs with given colorings and homomorphisms.

This page was built for publication: Construction of sparse graphs with prescribed circular colorings