Star chromatic number of some graphs
A proper vertex coloring of a graph [Formula: see text] is called a star coloring if every two color classes induce a forest whose each component is a star, which means there is no bicolored [Formula: see text] in [Formula: see text]. In this paper, we show that the Cartesian product of any two cycles, except [Formula: see text] and [Formula: see text], has a [Formula: see text]-star coloring.
Keyword(s):
Keyword(s):
2011 ◽
Vol Vol. 13 no. 3
(Graph and Algorithms)
◽
Keyword(s):
2012 ◽
Vol 49
(2)
◽
pp. 156-169
◽
2018 ◽
Vol 7
(4.10)
◽
pp. 393
2018 ◽
Vol 2
(1)
◽
pp. 30
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 1
(Graph Theory)
◽
Keyword(s):