3 research outputs found

    Uniquely List Colorability of Complete Split Graphs

    Get PDF
    The join of null graph Om and complete graph Kn, denoted by S(m; n), is called a complete split graph. In this paper, we characterize unique list colorability of the graph G = S(m; n). We shall prove that G is uniquely 3-list colorable graph if and only if m>=4, n>=4 and m + n>=10, m(G)>=4 for every 1<=m<=5 and n>=6.The join of null graph Om and complete graph Kn, denoted by S(m; n), is called a complete split graph. In this paper, we characterize unique list colorability of the graph G = S(m; n). We shall prove that G is uniquely 3-list colorable graph if and only if m>=4, n>=4 and m + n>=10, m(G)>=4 for every 1<=m<=5 and n>=6

    Some Conclusion on Unique k

    Get PDF
    If a graph G admits a k-list assignment L such that G has a unique L-coloring, then G is called uniquely k-list colorable graph, or UkLC graph for short. In the process of characterizing UkLC graphs, the complete multipartite graphs K1*r,s(r,s∈N) are often researched. But it is usually not easy to construct the unique k-list assignment of K1*r,s. In this paper, we give some propositions about the property of the graph K1*r,s when it is UkLC, which provide a very significant guide for constructing such list assignment. Then a special example of UkLC graphs K1*r,s as a application of these propositions is introduced. The conclusion will pave the way to characterize UkLC complete multipartite graphs
    corecore