A Characterization of Uniquely 2-List Colorable Graphs

@article{Mahdian1999ACO,
  title={A Characterization of Uniquely 2-List Colorable Graphs},
  author={Mohammad Mahdian and Ebadollah S. Mahmoodian},
  journal={Ars Comb.},
  year={1999},
  volume={51}
}
Let G be a graph with vertices, and let S 1 ; S 2 ; : : : ; S be a list of colors on its vertices, each of size k. If there exists a unique proper coloring for G from this list of colors, then G is called uniquely k{list colorable graph. We prove that a graph is uniquely 2{list colorable if and only if one of its blocks is not a cycle, a complete graph, or a complete bipartite graph. For each k, a uniquely k{list colorable graph is introduced. 

From This Paper

Topics from this paper.
7 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Choosability in graphs, in Proceed- ings, West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata

  • P. Erd os, A. L. Rubin, H. Taylor
  • CA, Sept
  • 1979
1 Excerpt

Coloring the vertices of a graph in prescribed colors, in Diskret. Analiz

  • V. G. Vizing
  • Metody Diskret. Anal. v. Teorii Kodov i Shem 101,
  • 1976
1 Excerpt

Murty,Graph Theory with Applications, American Elsevier Publishing Co., INC

  • U.S.R.J.A. Bondy
  • New York,
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…