On Generalized Choice and Coloring Numbers

@article{Dvok2019OnGC,
  title={On Generalized Choice and Coloring Numbers},
  author={Zdeněk Dvoř{\'a}k and Jakub Pek{\'a}rek and Jean-S{\'e}bastien Sereni},
  journal={Electron. J. Comb.},
  year={2019},
  volume={26},
  pages={1}
}
A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability.  We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph parameter. 

Figures from this paper

Generalized List Colouring of Graphs
This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.
Islands in minor-closed classes. I. Bounded treewidth and separators
The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic

References

SHOWING 1-10 OF 24 REFERENCES
Excluding any graph as a minor allows a low tree-width 2-coloring
Bounded size components--partitions and transversals
The t-Improper Chromatic Number of Random Graphs
TLDR
The t-improper chromatic number χt(G) is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most t.
Defective choosability of graphs with no edge‐plus‐independent‐set minor
TLDR
It is proved that, if s 2, a graph that does not have K2 þ Ks 1⁄4 K1 þ K1,s as a minor is ðs,1Þ -choosable whenever 0 d s 1, and this completes the proof that such a graph is choosable.
Islands in minor-closed classes. I. Bounded treewidth and separators
The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
TLDR
It is proved that, for each compact surface S, there is an integer k = k(S) such that every graph in S can be (4, k)-colored; the conjecture that 4 can be replaced by 3 in this statement is conjecture.
Defective coloring revisited
TLDR
This paper investigates the existence of such colorings in surfaces and the complexity of coloring problems, and shows that the (2, k)-coloring, for k ≥ 1, and the (3, 1-coloring problems are NP-complete even for planar graphs.
Degrees and choice numbers
  • N. Alon
  • Mathematics
    Random Struct. Algorithms
  • 2000
TLDR
It is proved that if the minimum degree of G is d, then its choice number is at least ( 1 2 − o(1)) log2 d, where the o( 1)-term tends to zero as d tends to infinity.
Partitioning into graphs with only small components
...
...