Journal of Siberian Federal University. Mathematics & Physics / Colorings of the Graph K ᵐ 2 + Kn

Full text (.pdf)
Issue
Journal of Siberian Federal University. Mathematics & Physics. 2020 13 (3)
Authors
Hung, Le Xuan
Contact information
Hung, Le Xuan: Hanoi University of Natural Resources and Environment Hanoi, Vietnam;
Keywords
chromatic number; list-chromatic number; chromatically unique graph; uniquely list colorable graph; complete r-partite graph
Abstract

In this paper, we characterize chromatically unique, determine list-chromatic number and characterize uniquely list colorability of the graph G = Km 2 + Kn. We shall prove that G is χ-unique, ch(G) = m + n, G is uniquely 3-list colorable graph if and only if 2m + n > 7 and m > 2

Pages
297–305
DOI
10.17516/1997-1397-2020-13-3-297-305
Paper at repository of SibFU
https://elib.sfu-kras.ru/handle/2311/135203