Add to ORKGThere 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. 1
The game chromatic number refers to the smallest integer k such that the first player Alice is assum...
International audienceWe study the chromatic index (edge - coloring number) of some products of regu...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
International audienceLet G = (V,E) be a graph with vertex set V and edge set E. Given non negative ...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
The game chromatic number refers to the smallest integer k such that the first player Alice is assum...
International audienceWe study the chromatic index (edge - coloring number) of some products of regu...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex ...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
International audienceLet G = (V,E) be a graph with vertex set V and edge set E. Given non negative ...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
The game chromatic number refers to the smallest integer k such that the first player Alice is assum...
International audienceWe study the chromatic index (edge - coloring number) of some products of regu...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...