List 3-coloring on comb-convex and caterpillar-convex bipartite graphs
{{output}}
Given a graph G = ( V , E ) and a list of available colors L(v) for each vertex v ∈ V , where L ( v ) ⊆ { 1 , 2 , … , k } , List k-Coloring refers to the problem of assigning colors to the vertices of G such that each vertex receives a col... ...
