Uniquely 2-List Colorable Graphs

Simple item page
dc.creatorGanjali, Y. G.
dc.creatorGhebleh, M.
dc.creatorHajiabolhassan, H.
dc.creatorMirzazadeh, M.
dc.creatorSadjad, B. S.
dc.date1999-06-28
dc.date2008-01-02
dc.date.accessioned2026-07-07T08:51:46Z
dc.date.available2026-07-07T08:51:46Z
dc.descriptionA graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2-list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a generalization of the well known Brooks' theorem.
dc.identifierhttps://arxiv.org/abs/math/9906187
dc.identifierhttp://arxiv.org/abs/math/9906187
dc.identifierDiscrete Appl. Math. 119 (2002), no. 3, 217--225
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145048
dc.subjectCombinatorics
dc.subject05C15
dc.titleUniquely 2-List Colorable Graphs
dc.typetext

Files

Collections

arXiv