(3, 1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles |
| |
Authors: | HAIHUI ZHANG |
| |
Abstract: | A graph G is called (k,d)?-choosable if for every list assignment L satisfying ∣L(v)∣ ≥k for all v∈V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this paper, it is proved that every graph of nonnegative characteristic without intersecting i-cycles for all i=3,4,5 is (3,1)?-choosable. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|