Circular choosability via combinatorial Nullstellensatz
From MaRDI portal
Publication:3605148
DOI10.1002/JGT.20333zbMATH Open1191.05040OpenAlexW4238813129MaRDI QIDQ3605148FDOQ3605148
Authors: Tsai-Lien Wong, Xuding Zhu, Serguei Norine 
Publication date: 20 February 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20333
Recommendations
Cites Work
- Recent developments in circular colouring of graphs
- Star chromatic number
- Circular chromatic number: A survey
- Colorings and orientations of graphs
- On two questions about circular choosability
- Circular choosability of graphs
- List circular coloring of trees and cycles
- Circular list colorings of some graphs
- Circular consecutive choosability of graphs
- Circular choosability
Cited In (8)
- Circular choosability
- On two questions about circular choosability
- On chromatic numbers of two extensions of planar graphs
- Choosability conjectures and multicircuits
- Circular choosability is rational
- Brooks' theorem via the Alon-Tarsi theorem
- List circular coloring of trees and cycles
- Circular consecutive choosability of \(k\)-choosable graphs
This page was built for publication: Circular choosability via combinatorial Nullstellensatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605148)
