Add to ORKGAbstract. A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. We characterize f-choosable functions for block graphs (graphs in which each block is a clique, including trees and line graphs of trees). The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f. The sum choice number of any graph is at most the number of vertices plus the number of edges. We show that this bound is tight for block graphs. Key words. list coloring, sum coloring, block graphs 1
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
A proper coloring of a graph is an assignment of colors to the vertices so that no two adjacent vert...
AbstractThe notion of the list-T-coloring is a common generalization of the T-coloring and the list-...
Let G = (V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is...
A graph is f-choosable if for every collection of lists with list sizes speci ed by f there is a p...
A graph G is said to be f-choosable if there exists a proper coloring from every assignment of lists...
AbstractA graph G is said to be f-choosable if there exists a proper coloring from every assignment ...
This thesis focuses on topics in extremal combinatorics. Given an integer-valued function f defined ...
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is...
AbstractLet f be a function assigning list sizes to the vertices of a graph G. The sum choice number...
\noindent{This thesis focuses on topics in extremal combinatorics.} Given an integer-valued funct...
A graph G is k-choosable if its vertices can be colored from any lists L(v) of colors with jL(v)j ...
Let f:V→N be a function on the vertex set of the graph G=(V,E). The graph G is f-choosable if for ev...
A (graph) property is a class of simple finite graphs closed under isomorphisms. In this paper we c...
List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allow...
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
A proper coloring of a graph is an assignment of colors to the vertices so that no two adjacent vert...
AbstractThe notion of the list-T-coloring is a common generalization of the T-coloring and the list-...
Let G = (V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is...
A graph is f-choosable if for every collection of lists with list sizes speci ed by f there is a p...
A graph G is said to be f-choosable if there exists a proper coloring from every assignment of lists...
AbstractA graph G is said to be f-choosable if there exists a proper coloring from every assignment ...
This thesis focuses on topics in extremal combinatorics. Given an integer-valued function f defined ...
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is...
AbstractLet f be a function assigning list sizes to the vertices of a graph G. The sum choice number...
\noindent{This thesis focuses on topics in extremal combinatorics.} Given an integer-valued funct...
A graph G is k-choosable if its vertices can be colored from any lists L(v) of colors with jL(v)j ...
Let f:V→N be a function on the vertex set of the graph G=(V,E). The graph G is f-choosable if for ev...
A (graph) property is a class of simple finite graphs closed under isomorphisms. In this paper we c...
List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allow...
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph ...
A proper coloring of a graph is an assignment of colors to the vertices so that no two adjacent vert...
AbstractThe notion of the list-T-coloring is a common generalization of the T-coloring and the list-...