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

JGT

2008

2008

: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors. If G has game coloring number m and G has acyclic chromatic number k, then the Cartesian product G G has game chromatic number at most k(k+m - 1). As a consequence, the Cartesian product of two forests has game chromatic number at most 10, and the Cartesian product of two planar graphs has game chromatic number at most 105.

Related Content

Added |
13 Dec 2010 |

Updated |
13 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
JGT |

Authors |
Xuding Zhu |

Comments (0)