科研之友
微信
新浪微博
Facebook
分享链接
摘要
The problem of minimum number of choosability of graphs was first introduced by Vizing. It appears in some practical problems when concerning frequency assignment. In this paper, we study two important list coloring, list edge coloring and list total coloring. We prove that and for planar graphs with and without adjacent 4-cycles.
