Circular choosability of graphs

DOI10.1002/jgt.20051zbMath1065.05044OpenAlexW4229521919MaRDI QIDQ4667800

Xuding Zhu

Publication date: 21 April 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20051

zbMATH Keywords

circular chromatic number\(k\)-degenerate graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ On two questions about circular choosability ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Circular consecutive choosability of k-choosable graphs ⋮ On chromatic numbers of two extensions of planar graphs ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ Circular choosability via combinatorial Nullstellensatz ⋮ Circular choosability is rational ⋮ Circular choosability ⋮ Circular list colorings of some graphs

This page was built for publication: Circular choosability of graphs