Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

GC
2008
Springer

favoriteEmaildiscussreport

143views Applied Computing» more GC 2008»

On the Acyclic Chromatic Number of Hamming Graphs

13 years 11 months ago

On the Acyclic Chromatic Number of Hamming Graphs

Download www.ces.clemson.edu

An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered. Upper and lower bounds on the acyclic chromatic number of Hamming graphs are given. Key words. acyclic coloring, Cartesian product of graphs, distance 2 coloring, Hamming graph

Robert E. Jamison, Gretchen L. Matthews

Real-time Traffic

Acyclic Chromatic Number | Acyclic Coloring | Applied Computing | GC 2008 | Proper Coloring |

claim paper

Related Content

» Algorithmic Aspects of Acyclic Edge Colorings

» Copositive programming motivated bounds on the stability and the chromatic numbers

» Optimal Acyclic Edge Colouring of Grid Like Graphs

» Forbidden Subgraph Colorings and the Oriented Chromatic Number

» Acyclic Edge Colouring of Outerplanar Graphs

» Game coloring the Cartesian product of graphs

» Acyclic and Star Colorings of Cographs

» On the oriented chromatic index of oriented graphs

» Acyclic vertex coloring of graphs of maximum degree 5

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	GC
Authors	Robert E. Jamison, Gretchen L. Matthews

Comments (0)