On structure of some plane graphs with application to choosability

On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability

Discrete Mathematics

Every toroidal graph without adjacent triangles is (4, 1)*-choosable

Discrete Applied Mathematics

List edge and list total colorings of planar graphs without 4-cycles

Theoretical Computer Science

On 3-choosability of planar graphs without certain cycles

Information Processing Letters

A Note on Edge Choosability and Degeneracy of Planar Graphs

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

RETRACTED ARTICLE: On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles

Information Processing Letters