List Colouring Big Graphs On-Line
Data Structures and Algorithms
2015-02-10 v1 Computer Science and Game Theory
Social and Information Networks
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.
Keywords
Cite
@article{arxiv.1502.02557,
title = {List Colouring Big Graphs On-Line},
author = {Martin Derka and Alejandro López-Ortiz and Daniela Maftuleac},
journal= {arXiv preprint arXiv:1502.02557},
year = {2015}
}