On -choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
Haihui Zhang (2013)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A graph is called -choosable if for every list assignment satisfying for all , there is an -coloring of such that each vertex of has at most neighbors colored with the same color as itself. In this paper, it is proved that every toroidal graph without chordal 7-cycles and adjacent 4-cycles is -choosable.