PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS
Let G be a graph with n vertices. Suppose that for each vertex v in G there exists a list L(v) of k colors, such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. A graph G is called a split graph if there exists a partiti...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2020-05-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/572 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832569595629666304 |
|---|---|
| author | Lê Xuân Hùng |
| author_facet | Lê Xuân Hùng |
| author_sort | Lê Xuân Hùng |
| collection | DOAJ |
| description | Let G be a graph with n vertices. Suppose that for each vertex v in G there exists a list L(v) of k colors, such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. A graph G is called a split graph if there exists a partition V = I È K such that the subgraphs of G induced by I and K are empty and complete, respectively. The notion of split graphs was introduced in 1977 by S. Foldes and P. L. Hammer, and these graphs have since received much attention in graph theory. In this paper, we characterize the properties of complete split graphs that are uniquely k-list colorable graphs. |
| format | Article |
| id | doaj-art-6b62d98592244c39a4f270031742f437 |
| institution | Kabale University |
| issn | 0866-787X 0866-787X |
| language | English |
| publishDate | 2020-05-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-6b62d98592244c39a4f270031742f4372025-02-02T20:08:56ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X0866-787X2020-05-01102859310.37569/DalatUniversity.10.2.572(2020)304PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHSLê Xuân Hùng0Trường Đại học Tài nguyên và Môi trường Hà NộiLet G be a graph with n vertices. Suppose that for each vertex v in G there exists a list L(v) of k colors, such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph. A graph G is called a split graph if there exists a partition V = I È K such that the subgraphs of G induced by I and K are empty and complete, respectively. The notion of split graphs was introduced in 1977 by S. Foldes and P. L. Hammer, and these graphs have since received much attention in graph theory. In this paper, we characterize the properties of complete split graphs that are uniquely k-list colorable graphs.http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/572đồ thị duy nhất k-tô màu danh sáchđồ thị tách cựctô màu danh sách đỉnhtô màu đỉnh. |
| spellingShingle | Lê Xuân Hùng PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS Tạp chí Khoa học Đại học Đà Lạt đồ thị duy nhất k-tô màu danh sách đồ thị tách cực tô màu danh sách đỉnh tô màu đỉnh. |
| title | PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS |
| title_full | PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS |
| title_fullStr | PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS |
| title_full_unstemmed | PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS |
| title_short | PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS |
| title_sort | properties of uniquely k list colorable complete split graphs |
| topic | đồ thị duy nhất k-tô màu danh sách đồ thị tách cực tô màu danh sách đỉnh tô màu đỉnh. |
| url | http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/572 |
| work_keys_str_mv | AT lexuanhung propertiesofuniquelyklistcolorablecompletesplitgraphs |