论文信息 - Harmonious Coloring of Honeycomb Networks

Harmonious Coloring of Honeycomb Networks

A harmonious coloring of a graph is the least numbe r of colors in a vertex coloring such that each pair of colors app ears on at most one edge. In this paper we provide an approximation algorithm to obtain the harmonious chromatic number of honeycomb networks.

I. Rajasingh | B. Rajan | Francis Xavier

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] John E. Hopcroft,et al. On the Harmonious Coloring of Graphs , 1983 .

[3] Hans L. Bodlaender,et al. Achromatic Number is NP-Complete for Cographs and Interval Graphs , 1989, Inf. Process. Lett..

[4] Colin McDiarmid,et al. The Complexity of Harmonious Colouring for Trees , 1995, Discret. Appl. Math..

[5] Keith Edwards,et al. The harmonious chromatic number and the achromatic number , 1997 .

[6] Keith Edwards. A new lower bound for the harmonious chromatic number , 1998, Australas. J Comb..

[7] Katerina Asdre,et al. NP-completeness results for some problems on subclasses of bipartite and chordal graphs , 2007, Theor. Comput. Sci..

[8] Katerina Asdre,et al. The harmonious coloring problem is NP-complete for interval and permutation graphs , 2007, Discret. Appl. Math..

[9] A. Sharieh,et al. Hex-Cell: Modeling, Topological Properties and Routing Algorithm , 2008 .