AbstractIn this paper, we show that the Alon–Tarsi theorem for choosability in graphs has an analogous version for the generalized list T-colorings—a concept which captures both the channel assignment problem and the T-colorings. We apply this result to cycles for generalized list labelings with a condition at distance two
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractStahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacen...
The generalized list T-coloring is a common generalization of many graph coloring models, including ...
AbstractGiven a set of nonnegative integers T. and a function S which assigns a set of integers S(v)...
AbstractList T-colouring is a generalisation of list colouring in which the differences between adja...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
AbstractThis paper starts with a discussion of several old and new conjectures about choosability in...
We study algebraic tools for proving the existence of graph colorings and focus a classical method o...
AbstractLet G=(V,E) be a simple graph, and for all v∈V, let L(v) be a list of colors assigned to v. ...
AbstractThe notion of the list-T-coloring is a common generalization of the T-coloring and the list-...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
In this thesis we study list coloring which was introduced independently by Vizing and Erd˝os, Rubin...
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
AbstractT-colorings arose from the channel assignment problem in communications. Given a finite set ...
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractStahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacen...
The generalized list T-coloring is a common generalization of many graph coloring models, including ...
AbstractGiven a set of nonnegative integers T. and a function S which assigns a set of integers S(v)...
AbstractList T-colouring is a generalisation of list colouring in which the differences between adja...
We study choosability with separation which is a constrained version of list coloring of graphs. A (...
AbstractThis paper starts with a discussion of several old and new conjectures about choosability in...
We study algebraic tools for proving the existence of graph colorings and focus a classical method o...
AbstractLet G=(V,E) be a simple graph, and for all v∈V, let L(v) be a list of colors assigned to v. ...
AbstractThe notion of the list-T-coloring is a common generalization of the T-coloring and the list-...
AbstractA list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex ...
In this thesis we study list coloring which was introduced independently by Vizing and Erd˝os, Rubin...
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
AbstractT-colorings arose from the channel assignment problem in communications. Given a finite set ...
AbstractA well-established generalization of graph coloring is the concept of list coloring. In this...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractStahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacen...
DOI
Add to ORKG