Sciweavers

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

35

SIAMDM
2010

favoriteEmaildiscussreport

133views more SIAMDM 2010»

Distinguishing Chromatic Number of Cartesian Products of Graphs

13 years 9 months ago

Distinguishing Chromatic Number of Cartesian Products of Graphs

Download dimacs.rutgers.edu

Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul

Real-time Traffic

SIAMDM 2010 |

claim paper

Related Content

» The distinguishing chromatic number of Cartesian products of two complete graphs

» Game chromatic number of Cartesian product graphs

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» Game coloring the Cartesian product of graphs

» Upper oriented chromatic number of undirected graphs and oriented colorings of product gra...

» The distinguishing number of Cartesian products of complete graphs

» On the Acyclic Chromatic Number of Hamming Graphs

» Optimal Acyclic Edge Colouring of Grid Like Graphs

» On the FirstFit Chromatic Number of Graphs

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul

Comments (0)