[[abstract]]The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. In this short note, we first give counterexamples to some results by Balogh et al.[[notice]]補正完
Vizing's theorem states that the chromatic index χ′(G) of a graph G is either the maximum degree Δ(G...
AbstractThe adaptable chromatic number of a graph G is the smallest integer k such that for any edge...
Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, ...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
One of the simplest heuristics for obtaining a proper coloring of a graph is the first-fit algorithm...
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
AbstractThis paper deals with greedy T-colorings of graphs, i.e. T-colorings produced by the greedy ...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
This project involved pulling together past work on the achromatic and first-fit chromatic numbers, ...
Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling f: V (G) → T, where | T | = k and...
The ∆(d)-chromatic number of a graph G, denoted by χ∆d (G), is the small-est number of colours with ...
8 pages, 3 figuresThe Grundy number of a graph is the maximum number of colours used by the ``First-...
We consider the t-improper chromatic number of the Erd′s-Rényi random graph Gn,p. The t-improper chr...
International audienceThe b-chromatic number of a graph G, denoted by b(G), is the largest positive ...
Let the vertices of a Cartesian product graph $G\Box H$ be ordered by an ordering $\sigma$. By the F...
Vizing's theorem states that the chromatic index χ′(G) of a graph G is either the maximum degree Δ(G...
AbstractThe adaptable chromatic number of a graph G is the smallest integer k such that for any edge...
Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, ...
AbstractThe first-fit chromatic number of a graph is the number of colors needed in the worst case o...
One of the simplest heuristics for obtaining a proper coloring of a graph is the first-fit algorithm...
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
AbstractThis paper deals with greedy T-colorings of graphs, i.e. T-colorings produced by the greedy ...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
This project involved pulling together past work on the achromatic and first-fit chromatic numbers, ...
Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling f: V (G) → T, where | T | = k and...
The ∆(d)-chromatic number of a graph G, denoted by χ∆d (G), is the small-est number of colours with ...
8 pages, 3 figuresThe Grundy number of a graph is the maximum number of colours used by the ``First-...
We consider the t-improper chromatic number of the Erd′s-Rényi random graph Gn,p. The t-improper chr...
International audienceThe b-chromatic number of a graph G, denoted by b(G), is the largest positive ...
Let the vertices of a Cartesian product graph $G\Box H$ be ordered by an ordering $\sigma$. By the F...
Vizing's theorem states that the chromatic index χ′(G) of a graph G is either the maximum degree Δ(G...
AbstractThe adaptable chromatic number of a graph G is the smallest integer k such that for any edge...
Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, ...
DOI
Add to ORKG