TY - JOUR AU - Xuan Hung, Le PY - 2021/07/29 Y2 - 2024/03/28 TI - Uniquely List Colorability of Complete Split Graphs JF - Selecciones Matemáticas JA - Sel.Mat. VL - 8 IS - 01 SE - DO - 10.17268/sel.mat.2021.01.11 UR - https://revistas.unitru.edu.pe/index.php/SSMM/article/view/3709 SP - 120 - 124 AB - <p>The join of null graph Om and complete graph Kn, denoted by S(m; n), is called a complete split graph.&nbsp;In this paper, we characterize unique list colorability of the graph G = S(m; n). We shall prove that G is uniquely 3-list colorable graph if and only if m&gt;=4, n&gt;=4 and m + n&gt;=10, m(G)&gt;=4 for every&nbsp;1&lt;=m&lt;=5 and n&gt;=6.</p> ER -