On Star Coloring of Mycielski's Graphs for Special Graphs

Author(s):  
Cai Jin ◽  
Shuangliang Tian ◽  
Zhuomo An
Keyword(s):  
2007 ◽  
Vol 29 (3) ◽  
pp. 1042-1072 ◽  
Author(s):  
Assefaw H. Gebremedhin ◽  
Arijit Tarafdar ◽  
Fredrik Manne ◽  
Alex Pothen
Keyword(s):  

Author(s):  
S. Akbari ◽  
M. CHAVOOSHI ◽  
M. Ghanbari ◽  
S. Taghian

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.


2021 ◽  
Author(s):  
Jin Cai ◽  
ShuangLiang Tian ◽  
ZhuoMo An
Keyword(s):  

Author(s):  
B. Akhavan Mahdavi ◽  
M. Tavakoli ◽  
F. Rahbarnia ◽  
Alireza Ashrafi

A star coloring of a graph [Formula: see text] is a proper coloring of [Formula: see text] such that no path of length 3 in [Formula: see text] is bicolored. In this paper, the star chromatic number of join of graphs is computed. Some sharp bounds for the star chromatic number of corona, lexicographic, deleted lexicographic and hierarchical product of graphs together with a conjecture on the star chromatic number of lexicographic product of graphs are also presented.


2009 ◽  
pp. n/a-n/a
Author(s):  
André Kündgen ◽  
Craig Timmons
Keyword(s):  

2017 ◽  
Vol 17 (3) ◽  
pp. 315-326
Author(s):  
Sangita Roy ◽  
Ashok Singh Sairam
Keyword(s):  

2010 ◽  
Vol 24 (1) ◽  
pp. 56-71 ◽  
Author(s):  
Ken-ichi Kawarabayashi ◽  
Bojan Mohar

Sign in / Sign up

Export Citation Format

Share Document