On -Choosability of -Vertex Graphs

Wongsakorn Charoenpanitseri

International Journal of Mathematics and Mathematical Sciences, 2015, vol. 2015, 1-6

Abstract:

A -list assignment of a graph is a mapping which assigns a set of size to each vertex of and . A graph is -choosable if has a proper coloring such that for each -list assignment . In 2011, Charoenpanitseri et al. gave a characterization of -choosability of -vertex graphs when and left open problems when . Recently, Ruksasakchai and Nakprasit obtain the results when . In this paper, we extend the results to case .

Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2015/690517.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2015/690517.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:jijmms:690517

DOI: 10.1155/2015/690517

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().