Uniquely List Colorability of Complete Split Graphs

• Xuan Hung, Le ^[1]
  1. [1] HaNoi University for Natural Resources and Environment 41 A, Phu Dien Road, Phu Dien precinct, North Tu Liem district, Hanoi, Vietnam.
• Localización: Selecciones Matemáticas, ISSN-e 2411-1783, Vol. 8, Nº. 1, 2021 (Ejemplar dedicado a: Enero-Julio), págs. 120-124
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • The join of null graph Om and complete graph Kn, denoted by S(m; n), is called a complete split graph. 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>=4, n>=4 and m + n>=10, m(G)>=4 for every 1<=m<=5 and n>=6.