Please use this identifier to cite or link to this item:
https://rsuir-library.rsu.ac.th/handle/123456789/2490| Title: | Research Project Report (k,t)-choosability of graphs |
| Other Titles: | การระบายสีแบบ (k,t) ของกราฟ |
| Authors: | Wongsakorn Charoenpanitser |
| Keywords: | Graph theory -- Research;Computer graphics -- Research |
| Issue Date: | 2014 |
| Publisher: | Research Institute of Rangsit University |
| metadata.dc.description.other-abstract: | 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 |Sv∈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, Punnim and Uiyyasathian 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 research report, we extend the results to case t = kn − k2 − 2k − 1. |
| URI: | https://rsuir-library.rsu.ac.th/handle/123456789/2490 |
| metadata.dc.type: | Other |
| Appears in Collections: | ICT-Research |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WONGSAKORN CHAROENPANITSERI.pdf | 804.05 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.