Circular choosability of graphs
From MaRDI portal
Publication:4667800
DOI10.1002/jgt.20051zbMath1065.05044MaRDI QIDQ4667800
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
Related Items
Randomly colouring graphs (a combinatorial view), Brooks' theorem via the Alon-Tarsi theorem, Circular list colorings of some graphs, Circular choosability is rational, Circular consecutive choosability of k-choosable graphs, On two questions about circular choosability, Circular choosability via combinatorial Nullstellensatz, Circular choosability