Colorings of the Graph K ᵐ 2 + Kn
2020 ◽
pp. 297-305
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
2012 ◽
Vol 21
(1-2)
◽
pp. 315-322
◽
2002 ◽
Vol 11
(1)
◽
pp. 103-111
◽
Keyword(s):
2016 ◽
Vol 99
(10)
◽
pp. 1571--1582
2000 ◽
Vol 9
(4)
◽
pp. 375-380
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol Vol. 16 no. 1
(Graph Theory)
◽
2006 ◽
Vol 306
(23)
◽
pp. 3078-3082
◽