Circular choosability
From MaRDI portal
Recommendations
Cites work
- \(T\)-choosability in graphs
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles
- Circular choosability of graphs
- Circular choosability via combinatorial Nullstellensatz
- Circular chromatic number of planar graphs of large odd girth
- Circular list colorings of some graphs
- Color-critical graphs on a fixed surface
- Every planar graph is 5-choosable
- High-girth graphs avoiding a minor are nearly bipartite
- Homomorphisms from sparse graphs with large girth.
- scientific article; zbMATH DE number 1496580 (Why is no real title available?)
- List T-colorings of graphs
- List circular coloring of trees and cycles
- On the asymptotic value of the choice number of complete multi‐partite graphs
- On two questions about circular choosability
Cited in
(11)- Circular degree choosability
- Circular choosability is rational
- On chromatic numbers of two extensions of planar graphs
- Circular consecutive choosability of k-choosable graphs
- Mixing homomorphisms, recolorings, and extending circular precolorings
- On two questions about circular choosability
- Circular choosability via combinatorial Nullstellensatz
- Circular choosability of graphs
- On circle graphs with girth at least five
- Circular list colorings of some graphs
- Circular consecutive choosability of graphs
This page was built for publication: Circular choosability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652533)
