Some Conclusion on Unique k‐List Colorable Complete Multipartite Graphs

Yanning Wang, Yanyan Wang and Xuguang Zhang

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/380861

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:380861

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().