Abstract
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 families of graphs, such as hypercubes, tori, d-dimensional grids, graphs with bounded treewidth and planar graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Alon, C. McDiarmid, and B. Reed. Acyclic colourings of graphs. Random Structures and Algorithms, 2:277–288, 1990.
O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic k-strong coloring of maps on surfaces. Mathematical Notes, 67(1):29–35, 2000.
O.V. Borodin, A.V. Kostochka, and D.R. Woodall. Acyclic colourings of planar graphs with large girth. J. London Math. Soc., 60(2):344–352, 1999.
A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes A survey. SIAM Monographs on D.M. and Applications, 1999.
H.L. Bodlander. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1–45, 1998.
O.V. Borodin. On acyclic colorings of planar graphs. Discrete Mathematics, 25:211–236, 1979.
G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. Technical report, 2001.
B. Grünbaum. Acyclic colorings of planar graphs. Israel J. Math., 14(3):390–408, 1973.
D.S. Kim, D.-Z. Du, and P.M. Pardalos. A coloring problem on the n-cube. Discrete Applied Mathematics, 103:307–311, 2000.
T.A. McKee and F.R. McMorris. Topics in intersection graph theory. SIAM Monographs on D.M. and Applications, 1999.
N. Robertson and P.D. Seymour. Graph minors. 1. excluding a forest. J. Combin. Theory Ser. B, 35:39–61, 1983.
P.-J. Wan. Near-optimal conflict-free channel set assignments for an optical clusterbased hypercube network. J. Combin. Optim., 1:179–186, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fertin, G., Raspaud, A., Reed, B. (2001). On Star Coloring of Graphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive