AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point independence number of the lexicographic product of two graphs are examined in relation to the values of the respective parameters on the factor graphs
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
In this paper, we determine the exact values of the game chromatic number of lexicographic product o...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
There are four standard products of graphs: the direct product, the Cartesian product, the strong pr...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinar...
Abstract: Let f(n) minf (G H) : G and H are n-chromatic digraphsg and g(n) minf (G H) : G and H ...
International audienceWe study the chromatic index (edge - coloring number) of some products of regu...
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
In this paper, we determine the exact values of the game chromatic number of lexicographic product o...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
There are four standard products of graphs: the direct product, the Cartesian product, the strong pr...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinar...
Abstract: Let f(n) minf (G H) : G and H are n-chromatic digraphsg and g(n) minf (G H) : G and H ...
International audienceWe study the chromatic index (edge - coloring number) of some products of regu...
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such...
DOI
Add to ORKG