摘要
令G为1个给定的图.假设对图G的每1个顶点v,存在1个k色列表L(v),使得G存在唯一L-染色,则称G为唯一列表可染图.M.Ghebleh和E.S.Mahmoodian几乎完全刻画了唯一3-列表可染完全多部图,仅剩9个图没有解决.图K2,2,4和K2,2,5为2个没有解决的图.通过证明得知图K2,2,4和K2,2,5具有M(3)性质.
Suppose that for each vertex in a given graph,there exists a list of colors,making graph a unique proper coloring,called a uniquely k-list colorable graph. M. Ghebleh and E. S. Mahmoodian characterized uniquely k-list colorable complete muhipartite graphs except for nine graphs. Graphs K2,2,4 and K2,2,5 proved to have the property M（3）.
出处
《石家庄学院学报》
2006年第3期1-3,6,共4页
Journal of Shijiazhuang University
