Tbilisi Mathematical Journal
- Tbilisi Math. J.
- Volume 9, Issue 1 (2016), 271-278.
Chromatic number of Harary graphs
A proper coloring of a graph $G$ is a function from the vertices of the graph to a set of colors such that any two adjacent vertices have different colors, and the chromatic number of $G$ is the minimum number of colors needed in a proper coloring of a graph. In this paper, we will find the chromatic number of the Harary graphs, which are the circulant graphs in some cases.
Tbilisi Math. J., Volume 9, Issue 1 (2016), 271-278.
Received: 16 January 2016
Accepted: 5 May 2016
First available in Project Euclid: 12 June 2018
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 05C15: Coloring of graphs and hypergraphs
Kazemi, Adel P.; Jalilolghadr, Parvin. Chromatic number of Harary graphs. Tbilisi Math. J. 9 (2016), no. 1, 271--278. doi:10.1515/tmj-2016-0013. https://projecteuclid.org/euclid.tbilisi/1528769050