This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Lih, Ko-Wei Song, Zengmin Wang, Weifan and Zhang, Kemin 2001. A note on list improper coloring planar graphs. Applied Mathematics Letters, Vol. 14, Issue. 3, p. 269.
Miao, Zhengke 2003. Improper choosability of graphs embedded on the surface of genus r. Discrete Mathematics, Vol. 269, Issue. 1-3, p. 311.
Dunn, Charles and Kierstead, H.A. 2004. A simple competitive graph coloring algorithm II. Journal of Combinatorial Theory, Series B, Vol. 90, Issue. 1, p. 93.
Havet, Frédéric and Sereni, Jean-Sébastien 2005. Graph-Theoretic Concepts in Computer Science. Vol. 3787, Issue. , p. 81.
Havet, F. Kang, R.J. and Sereni, J.-S. 2005. Improper Colourings of Unit Disk Graphs. Electronic Notes in Discrete Mathematics, Vol. 22, Issue. , p. 123.
Havet, Frédéric and Sereni, Jean-Sébastien 2006. Improper choosability of graphs and maximum average degree. Journal of Graph Theory, Vol. 52, Issue. 3, p. 181.
Berke, Robert and Szabó, Tibor 2006. Algorithms – ESA 2006. Vol. 4168, Issue. , p. 124.
Dunn, Charles 2007. The relaxed game chromatic index of k-degenerate graphs. Discrete Mathematics, Vol. 307, Issue. 14, p. 1767.
Xu, Baogang and Zhang, Haihui 2007. Every toroidal graph without adjacent triangles is (4,1)*-choosable. Discrete Applied Mathematics, Vol. 155, Issue. 1, p. 74.
Esperet, Louis and Pinlou, Alexandre 2007. Acyclic improper choosability of graphs. Electronic Notes in Discrete Mathematics, Vol. 28, Issue. , p. 251.
Esperet, Louis Montassier, Mickaël and Raspaud, André 2008. Linear choosability of graphs. Discrete Mathematics, Vol. 308, Issue. 17, p. 3938.
Kang, Ross J. Müller, Tobias and Sereni, Jean-Sébastien 2008. Improper colouring of (random) unit disk graphs. Discrete Mathematics, Vol. 308, Issue. 8, p. 1438.
Chen, Yongzhu Zhu, Weiyi and Wang, Weifan 2008. Improper choosability of graphs of nonnegative characteristic. Computers & Mathematics with Applications, Vol. 56, Issue. 8, p. 2073.
DONG, WEI and XU, BAOGANG 2009. ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS. Discrete Mathematics, Algorithms and Applications, Vol. 01, Issue. 02, p. 291.
Havet, Frédéric Kang, Ross J. and Sereni, Jean-Sébastien 2009. Improper coloring of unit disk graphs. Networks, Vol. 54, Issue. 3, p. 150.
Dong, Wei and Xu, Baogang 2009. A note on list improper coloring of plane graphs. Discrete Applied Mathematics, Vol. 157, Issue. 2, p. 433.
Borodin, O. V. Ivanova, A. O. Montassier, M. Ochem, P. and Raspaud, A. 2010. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. Journal of Graph Theory, Vol. 65, Issue. 2, p. 83.
Min, Alexander W. and Shin, Kang G. 2010. On Sensing-Access Tradeoff in Cognitive Radio Networks. p. 1.
KANG, ROSS J. and McDIARMID, COLIN 2010. The t-Improper Chromatic Number of Random Graphs. Combinatorics, Probability and Computing, Vol. 19, Issue. 1, p. 87.
Cushing, William and Kierstead, H.A. 2010. Planar graphs are 1-relaxed, 4-choosable. European Journal of Combinatorics, Vol. 31, Issue. 5, p. 1385.