Corpus ID: 10438449

A Characterization of Uniquely 2-List Colorable Graphs

  title={A Characterization of Uniquely 2-List Colorable Graphs},
  author={Mohammad Mahdian and E. Mahmoodian},
  journal={Ars Comb.},
  • Mohammad Mahdian, E. Mahmoodian
  • Published 1999
  • Mathematics, Computer Science
  • Ars Comb.
  • 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. 

    Topics from this paper.

    On Uniquely List Colorable Graphs
    • 12
    • Open Access
    Uniquely 2-list colorable graphs
    • 10
    • Open Access
    Characterization of graphs with Hall index 2
    • 6
    Some concepts in list coloring
    • 6
    • Open Access
    Complexity of unique list colorability
    • D. Marx
    • Computer Science, Mathematics
    • 2008
    • 6
    • Open Access
    Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
    • 4
    Some Conclusion on Unique k-List Colorable Complete Multipartite Graphs
    • 2
    • Open Access
    Unique list-colourability and the fixing chromatic number of graphs
    • 1
    • Open Access


    Publications referenced by this paper.
    Graph Theory with Applications
    • 1,873
    • Open Access
    Restricted colorings of graphs
    • 202
    • Open Access
    Defining sets in vertex colorings of graphs and latin rectangles
    • 50
    • Open Access
    Distinct representatives of subsets
    • 196
    • Open Access
    The Size of the Smallest Strong Critical Set in a Latin Square
    • 45
    • Open Access
    Graph Theory With Applications
    • 2,001
    • Highly Influential
    • Open Access
    Choosability in graphs
    • 1979
    Choosability in graphs, in Proceed- ings, West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata
    • 1979
    Metody Diskret. Anal. v. Teorii Kodov i Shem
    • 1976