AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the strong product and the lexicographic product. The chromatic number turned out to be an interesting parameter on all these products, except on the Cartesian one. A survey is given on the results concerning the chromatic number of the three relevant products. Some applications of product colorings are also included
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
There are four standard products of graphs: the direct product, the Cartesian product, the strong pr...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
Recent results show that several important graph classes can be embedded as subgraphs of strong prod...
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two verti...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
International audienceLet G = (V,E) be a graph with vertex set V and edge set E. Given non negative ...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
There are four standard products of graphs: the direct product, the Cartesian product, the strong pr...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
Recent results show that several important graph classes can be embedded as subgraphs of strong prod...
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two verti...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
International audienceLet G = (V,E) be a graph with vertex set V and edge set E. Given non negative ...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...