AbstractWe study list coloring problems where the total number k of colors on all lists is fixed. Such problems are known to be NP-Complete even for planar bipartite graphs and k=3. We give polynomial algorithms for some special cases of these problems
Abstract. List colouring is an NP-complete decision problem even if the total number of colours is t...
The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that n...
AbstractThe k-Coloring problem is to decide whether a graph can be colored with at most k colors suc...
AbstractWe study list coloring problems where the total number k of colors on all lists is fixed. Su...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
We study complexity issues related to some coloring problems in grids: we examine in particular the ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allow...
AbstractGiven a graph G = (V,E) and a finite set L(v) at each vertex v ϵ V, the List Coloring proble...
AbstractWe investigate a restricted list-coloring problem. Given a graph G = (V, E), a non empty set...
We study complexity issues related to some coloring problems in grids: we examine in particular the ...
In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polyn...
Abstract. List colouring is an NP-complete decision problem even if the total number of colours is t...
The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that n...
AbstractThe k-Coloring problem is to decide whether a graph can be colored with at most k colors suc...
AbstractWe study list coloring problems where the total number k of colors on all lists is fixed. Su...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
We study complexity issues related to some coloring problems in grids: we examine in particular the ...
List coloring is an NP-complete decision problem even if the total number of colors is three. It is ...
List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allow...
AbstractGiven a graph G = (V,E) and a finite set L(v) at each vertex v ϵ V, the List Coloring proble...
AbstractWe investigate a restricted list-coloring problem. Given a graph G = (V, E), a non empty set...
We study complexity issues related to some coloring problems in grids: we examine in particular the ...
In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polyn...
Abstract. List colouring is an NP-complete decision problem even if the total number of colours is t...
The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that n...
AbstractThe k-Coloring problem is to decide whether a graph can be colored with at most k colors suc...