Some Conclusion on Unique -List Colorable Complete Multipartite Graphs

Yanning Wang, Yanyan Wang and Xuguang Zhang

Journal of Applied Mathematics, 2013, vol. 2013, 1-5

Abstract:

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

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2013/380861.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/380861.xml (text/xml)

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:hin:jnljam:380861

DOI: 10.1155/2013/380861

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().