On Uniquely List Colorable Graphs

  title={On Uniquely List Colorable Graphs},
  author={Mohammad Ghebleh and Ebadollah S. Mahmoodian},
  journal={Ars Comb.},
Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors, L(v), such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k–list colorable graph. Recently M. Mahdian and E.S. Mahmoodian characterized uniquely 2–list colorable graphs. Here we state some results which will pave the way in characterization of uniquely k–list colorable graphs. There is a relationship between this concept and defining… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

On the uniquely list colorable graphs

E. S. Mahmoodian, M. Mahdian
In Proceedings of the 28th Annual Iranian Mathematics Conference, • 1997
View 2 Excerpts
Highly Influenced

A characterization of uniquely 2 – list colorable graphs

E. S. Mahmoodian.
Congr . Numer . • 1996

Critical sets for latin squares, graphs, and block designs: a survey

A. D. Keedwell
Congr. Numer., • 1996
View 1 Excerpt

Introduction to graph theory

D. B. West
View 1 Excerpt

Every planar graph is 5choosable

G. H. J. van Rees, J. A. Bate
J . Comb . Theory B • 1994

Choosability in graphs. In Proceedings of west coast conference on combinatorics, graph theory, and computing, number 26 in Congr

P. Erdös, A. L. Rubin, H. Taylor

Hall . Distinct representatives of subsets

Proceedings of west coast conference on combinatorics , graph theory , and computing , number 26 in Congr . Numer . , pages • 1979

Similar Papers

Loading similar papers…