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
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Siberian Federal University. Mathematics & Physics
Paper Title
Journal
Date
