summary:The achromatic number of a graph $G$ is the maximum number of colours in a proper vertex colouring of $G$ such that for any two distinct colours there is an edge of $G$ incident with vertices of those two colours. We determine the achromatic number of the Cartesian product of $K_5$ and $K_n$ for all $n \le 24$
A complete k-coloring of a graph ＄G＄ is a map from the vertices of ＄G＄ to ＄k＄ colors such that any t...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
A complete $k$-colouring of a hypergraph is an assignment of $k$ colours to the points such that (1)...
summary:The achromatic number of a graph $G$ is the maximum number of colours in a proper vertex co...
AbstractAchromatic number of a graph G is a maximum number of colours in a proper vertex colouring o...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
A complete colouring of a simple graph G is a proper vertex colouring such that each pair of colours...
Let G be a simple graph. The achromatic number ?(G) is the largest number of colors possible in a pr...
The achromatic number problem is to legally color the vertices of an input graph with the maximum nu...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
International audienceThe chromatic number, which refers to the minimum number of colours required t...
AbstractThe achromatic number of a graph G is the largest number of colours which can be assigned to...
The achromatic number ?(G) of a simple graph G is the largest number of colours possible in a proper...
The achromatic number of a graph is the greatest number of colors in a coloring of the vertices of t...
AbstractThe achromatic number ψ(G) of a simple graph G is the largest number of colours possible in ...
A complete k-coloring of a graph ＄G＄ is a map from the vertices of ＄G＄ to ＄k＄ colors such that any t...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
A complete $k$-colouring of a hypergraph is an assignment of $k$ colours to the points such that (1)...
summary:The achromatic number of a graph $G$ is the maximum number of colours in a proper vertex co...
AbstractAchromatic number of a graph G is a maximum number of colours in a proper vertex colouring o...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
A complete colouring of a simple graph G is a proper vertex colouring such that each pair of colours...
Let G be a simple graph. The achromatic number ?(G) is the largest number of colors possible in a pr...
The achromatic number problem is to legally color the vertices of an input graph with the maximum nu...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
International audienceThe chromatic number, which refers to the minimum number of colours required t...
AbstractThe achromatic number of a graph G is the largest number of colours which can be assigned to...
The achromatic number ?(G) of a simple graph G is the largest number of colours possible in a proper...
The achromatic number of a graph is the greatest number of colors in a coloring of the vertices of t...
AbstractThe achromatic number ψ(G) of a simple graph G is the largest number of colours possible in ...
A complete k-coloring of a graph ＄G＄ is a map from the vertices of ＄G＄ to ＄k＄ colors such that any t...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
A complete $k$-colouring of a hypergraph is an assignment of $k$ colours to the points such that (1)...
DOI
Add to ORKG