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
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractThe star-chromatic number and the fractional-chromatic number are two generalizations of the...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a...
Figueroa-Centeno et al. [4] introduced the following product of digraphs let D be a digraph and let ...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...
This paper studies the choice number and paint number of the lexicographic product of graphs. We pro...
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as No...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
AbstractIn this paper, we determine the exact values of the game chromatic number of lexicographic p...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractThe star-chromatic number and the fractional-chromatic number are two generalizations of the...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a...
Figueroa-Centeno et al. [4] introduced the following product of digraphs let D be a digraph and let ...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...
This paper studies the choice number and paint number of the lexicographic product of graphs. We pro...
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as No...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
DOI
Add to ORKG