A (graph) property is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties
D. Phil (Mathematics)In this thesis we investigate generalized chromatic numbers in the context of h...
AbstractIn this paper, we show that the Alon–Tarsi theorem for choosability in graphs has an analogo...
We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the ...
Abstract. A graph is f-choosable if for every collection of lists with list sizes specified by f the...
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, ...
Let G = (V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is...
grantor: University of TorontoThe sum coloring problem asks to find a vertex coloring of ...
In online list coloring (introduced by Zhu and by Schauz in 2009), on each round the set of vertices...
AbstractWe consider the sum coloring (chromatic sum) problem and the sum multi-coloring problem for ...
The notion of the b-chromatic number of a graph attracted much research interests and recently a new...
AbstractThe sum coloring problem asks to find a vertex coloring of a given graph G, using natural nu...
AbstractThe chromatic sum of a graph is the minimum total of the colors on the vertices taken over a...
The concepts of sum graph and integral sum graph were introduced by Harary [7], [8]. A sum graph is ...
A graph is f-choosable if for every collection of lists with list sizes speci ed by f there is a p...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k]...
D. Phil (Mathematics)In this thesis we investigate generalized chromatic numbers in the context of h...
AbstractIn this paper, we show that the Alon–Tarsi theorem for choosability in graphs has an analogo...
We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the ...
Abstract. A graph is f-choosable if for every collection of lists with list sizes specified by f the...
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, ...
Let G = (V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is...
grantor: University of TorontoThe sum coloring problem asks to find a vertex coloring of ...
In online list coloring (introduced by Zhu and by Schauz in 2009), on each round the set of vertices...
AbstractWe consider the sum coloring (chromatic sum) problem and the sum multi-coloring problem for ...
The notion of the b-chromatic number of a graph attracted much research interests and recently a new...
AbstractThe sum coloring problem asks to find a vertex coloring of a given graph G, using natural nu...
AbstractThe chromatic sum of a graph is the minimum total of the colors on the vertices taken over a...
The concepts of sum graph and integral sum graph were introduced by Harary [7], [8]. A sum graph is ...
A graph is f-choosable if for every collection of lists with list sizes speci ed by f there is a p...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k]...
D. Phil (Mathematics)In this thesis we investigate generalized chromatic numbers in the context of h...
AbstractIn this paper, we show that the Alon–Tarsi theorem for choosability in graphs has an analogo...
We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the ...
DOI
Add to ORKG