On Star Coloring of Graphs

  title={On Star Coloring of Graphs},
  author={Guillaume Fertin and Andr{\'e} Raspaud and Bruce A. Reed},
In this paper, we deal with the notion of star coloring of graphs. A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. We give the exact value of the star chromatic number of different families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for the star chromatic number of other… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

On star coloring of graphs

  • G. Fertin, A. Raspaud, B. Reed
  • Technical report,
  • 2001

Graph Classes A survey

  • A. Brandstädt, V. B. Le, J. P. Spinrad
  • SIAM Monographs on D.M. and Applications,
  • 1999

Topics in intersection graph theory

  • T. A. McKee, F. R. McMorris
  • SIAM Monographs on D.M. and Applications,
  • 1999

Borodin . On acyclic colorings of planar graphs

  • A. Raspaud G. Fertin, B. Reed.
  • Discrete Mathematics
  • 1979