List Improper Colourings of Planar Graphs
Combinatorics, Probability and Computing
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
Discrete Applied Mathematics
Improper choosability of graphs of nonnegative characteristic
Computers & Mathematics with Applications
Note: A note on list improper coloring of plane graphs
Discrete Applied Mathematics
Choosability of toroidal graphs without short cycles
Journal of Graph Theory
On (3,1 )*-choosability of planar graphs without adjacent short cycles
Discrete Applied Mathematics
| Hi-index | 0.04 |
An (L,d)^*-coloring is a mapping @f that assigns a color @f(v)@?L(v) to each vertex v@?V(G) such that at most d neighbors of v receive color @f(v). A graph G is called (k,d)^*-choosable if it admits an (L,d)^*-coloring for every list assignment L with |L(v)|=k for all v@?V(G). Let G be a graph embeddable on the torus. In this paper, it is proved that G is (3,1)^*-choosable if G contains no 5- and 6-cycles.