Photo from wikipedia
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.… Click to show full abstract
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.
Keywords:
coloring graph;
see text;
formula see;
star coloring;
chromatic number;
star chromatic
Journal Title: Asian-European Journal of Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Asian-European Journal of Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!