List Colouring Big Graphs On-Line
classification
💻 cs.DS
cs.GTcs.SI
keywords
on-linecolouringgraphslistseveralalternateclassconjecture
read the original abstract
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13] and Zhu [20]. We prove that the on-line version of Ohba's conjecture is true in the class of planar graphs. We also consider several alternate on-line list colouring models.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.