In this paper, upper and lower bounds are presented for the star chromatic number of the rooted product, hierarchical product, and lexicographic product.

The minimum positive integer k k for which G G is k k -star-colorable is the star chromatic number of G G and is denoted by χs(G) χ s ( G ) . In this paper, ...

The star chromatic number of G, χ_s (G), is the least integer k such that G is k-star colourable. We prove that χ_s (G) ≥ (d + 4)/2 for every d-regular graph G ...

In light of Theorem 2, define the star chromatic number x*(G) as the least of the 2,-chromatic numbers. If G is a connected graph with n vertices, x*(G) = min ...

The star-chromatic number of a graph, a concept introduced by Vince, is a natural generalization of the chromatic number of a graph. We.

The star-chromatic number of a graph, a concept introduced by. Vince, is a natural generalization of the chromatic number of a graph.

The aim of this paper is to study the star colouring of some Circulant graphs and to determined the star chromatic number of some graph families formed from the ...

We investigate the relation between the star-chromatic number χ(G) and the chromatic number χ(G) of a graphG.

The star-chromatic number of a graph, a concept introduced by Vince, is natural generalization of the chromatic number of a graph.

Missing: products. | Show results with:products.