On (k,kn-k2-2k-1)-Choosability of n-Vertex Graphs
A (k,t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v of G and |⋃v∈V(G)L(v)|=t. A graph G is (k,t)-choosable if G has a proper coloring f such that f(v)∈L(v) for each (k,t)-list assignment L. In 2011, Charoenpanitseri et al. gave a characterization of (...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2015/690517 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A (k,t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v of G and |⋃v∈V(G)L(v)|=t. A graph G is (k,t)-choosable if G has a proper coloring f such that f(v)∈L(v) for each (k,t)-list assignment L. In 2011, Charoenpanitseri et al. gave a characterization of (k,t)-choosability of n-vertex graphs when t≥kn-k2-2k+1 and left open problems when t≤kn-k2-2k. Recently, Ruksasakchai and Nakprasit obtain the results when t=kn-k2-2k. In this paper, we extend the results to case t=kn-k2-2k-1. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |