Abstract
The star chromatic number X ∗( G), introduced by Vince [1], of a graph G = ( V,E) is the least rational number k/d such that for V → [ k], the modular distance between the colors of any two adjacent vertices is at least d. We present an infinite family of triangle-free planar graphs and show that the star chromatic number of these graphs is 3.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call