IPM

“ Schools ”

Astronomy
Cognitive Sciences
Computer Science
Mathematics
Nano-Science
Particles and Accelerators
Philosophy
Physics

“ Centers and Units ”

GCG Computing Group
Information Center
Iranian Light Source Facility
Iranian National Observatory
IRNIC
Library
Network Center

“ Research Groups ”

Bioinformatics
Combinatorics and Computing
Commutative Algebra
Logic
IPM HPC Laboratory

“ Useful Links ”

Gallery of Visitors
Contact Us
Gallery of Photos

“ E-Services ”

Webmail
Official Automation System
Library
Telephone Book

“School of Mathematics”

Paper IPM / M / 2369

School of Mathematics

Title:

Uniquely 2-list colorable graphs

Author(s):

1 .	Y. G. Ganjali
2 .	M. Ghebleh
3 .	H. Hajiabolhassan
4 .	M. Mirzazadeh
5 .	B. S. Sadjad

Status:

Published

Journal:

Discrete Appl. Math.

Vol.:

119

Year:

2003

Pages:

217-225

Supported by:

IPM

Abstract:

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.

Download TeX format