Uniquely 2-list colorable graphs

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 i...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 119; no. 3; pp. 217 - 225
Main Authors Ganjali, Y.G., Ghebleh, M., Hajiabolhassan, H., Mirzazadeh, M., Sadjad, B.S.
Format Journal Article
LanguageEnglish
Published Lausanne Elsevier B.V 15.07.2002
Amsterdam Elsevier
New York, NY
Subjects
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Existence theorem
Finite graph
Graph colouring
Triangle free graph
Graph theory
Bipartite graph
Chromatic number
Uniqueness theorem
Two list graph
Non directed graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(00)00335-8