@article{Albert Khachik Sahakyan_2021, title={LIST COLORING OF BLOCK GRAPHS AND COMPLETE BIPARTITE GRAPHS}, url={https://rsglobal.pl/index.php/ws/article/view/2112}, DOI={10.31435/rsglobal_ws/30082021/7661}, abstractNote={<p>List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allowed colors. For a given graph G and a set L(v) of colors for every vertex v, a list coloring is a function that maps every vertex v to a color in the list L(v) such that no two adjacent vertices receive the same color. It was first studied in the 1970s in independent papers by Vizing and by Erdős, Rubin, and Taylor. A block graph is a type of undirected graph in which every biconnected component (block) is a clique. A complete bipartite graph is a bipartite graph with partitions V 1, V 2 such that for every two vertices v_1∈V_1 and v_2∈V_2 there is an edge (v 1, v 2). If |V_1 |=n and |V_2 |=m it is denoted by K_(n,m). In this paper we provide a polynomial algorithm for finding a list coloring of block graphs and prove that the problem of finding a list coloring of K_(n,m) is NP-complete even if for each vertex v the length of the list is not greater than 3 (|L(v)|≤3).</p>}, number={8(69)}, journal={World Science}, author={Albert Khachik Sahakyan}, year={2021}, month={Aug.} }