Can I read Uniquely 2-List Colorable Graphs on EtoBox?

Uniquely 2-List Colorable Graphs by Y.G. Ganjali; M. Ghebleh; H. Hajiabolhassan; M. Mirzazadeh; B.S. Sadjad is a Computer Science article available to read on EtoBox.

What is Uniquely 2-List Colorable Graphs about?

A graph is said 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. ?

Who reads Uniquely 2-List Colorable Graphs?

Author

Y.G. Ganjali; M. Ghebleh; H. Hajiabolhassan; M. Mirzazadeh; B.S. Sadjad

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)

Published

2002

Language

EN

Field

Computer Science (Physical Sciences)