Add to ORKGThis paper studies the on-line choice number of complete multipartite graphs with independence number m. We give a unified strategy for every prescribed m. Our main result leads to several interesting consequences comparable to known re-sults. (1) If k1− m∑ p=2 p2 2 − 3p
In this paper, the on-line list colouring of binomial random graphs G(n,p) is studied. We show that ...
The choice number is a graph parameter that generalizes the chromatic number. In this concept vertic...
Abstract. In this paper, the on-line list colouring of binomial random graphs G (n, p) is studied. W...
Abstract. Let ch(G) denote the choice number of a graph G, and let Ks∗k be the complete k-partite gr...
Abstract. Let ch(G) denote the choice number of a graph G, and let Ks∗k be the complete k-partite gr...
The choice number of a graph G is the smallest integer k such that for every assignment of a list L(...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA graph G is called chromatic-choosable if its choice number is equal to its chromatic numbe...
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is...
AbstractThe interval number of a graph G, denoted i(G), is the least positive integer t for which G ...
Let ch(G) denote the choice number of a graph G (also called “list chromatic num-ber ” or “choosabil...
Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosabilit...
Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosabilit...
Let be a graph of order and size . Suppose that is a function such that . In this paper we provide a...
In this paper, the on-line list colouring of binomial random graphs G(n,p) is studied. We show that ...
The choice number is a graph parameter that generalizes the chromatic number. In this concept vertic...
Abstract. In this paper, the on-line list colouring of binomial random graphs G (n, p) is studied. W...
Abstract. Let ch(G) denote the choice number of a graph G, and let Ks∗k be the complete k-partite gr...
Abstract. Let ch(G) denote the choice number of a graph G, and let Ks∗k be the complete k-partite gr...
The choice number of a graph G is the smallest integer k such that for every assignment of a list L(...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractA graph G is called chromatic-choosable if its choice number is equal to its chromatic numbe...
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is...
AbstractThe interval number of a graph G, denoted i(G), is the least positive integer t for which G ...
Let ch(G) denote the choice number of a graph G (also called “list chromatic num-ber ” or “choosabil...
Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosabilit...
Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosabilit...
Let be a graph of order and size . Suppose that is a function such that . In this paper we provide a...
In this paper, the on-line list colouring of binomial random graphs G(n,p) is studied. We show that ...
The choice number is a graph parameter that generalizes the chromatic number. In this concept vertic...
Abstract. In this paper, the on-line list colouring of binomial random graphs G (n, p) is studied. W...