Circular choosability
From MaRDI portal
Publication:3652533
DOI10.1002/jgt.20375zbMath1180.05044OpenAlexW4249657637MaRDI QIDQ3652533
Jean-Sébastien Sereni, Tobias Müller, Frédéric Havet, Ross J. Kang
Publication date: 18 December 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00496432/file/HKMS09.pdf
girthplanar graphcircular coloringcircular choosabilitycircular choice numbergraph with bounded density
Related Items
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ On circle graphs with girth at least five ⋮ On chromatic numbers of two extensions of planar graphs ⋮ Circular choosability via combinatorial Nullstellensatz ⋮ Circular choosability is rational
Cites Work
- Unnamed Item
- Circular list colorings of some graphs
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles
- List \(T\)-colorings of graphs
- Every planar graph is 5-choosable
- Color-critical graphs on a fixed surface
- \(T\)-choosability in graphs
- Homomorphisms from sparse graphs with large girth.
- High-girth graphs avoiding a minor are nearly bipartite
- On two questions about circular choosability
- Circular choosability via combinatorial Nullstellensatz
- Circular choosability of graphs
- List circular coloring of trees and cycles
- On the asymptotic value of the choice number of complete multi‐partite graphs
- Circular chromatic number of planar graphs of large odd girth
