Journal of Combinatorial Optimization

, Volume 25, Issue 4, pp 752–765

The game Grundy number of graphs

Article

Abstract

Given a graph G=(V,E), two players, Alice and Bob, alternate their turns in choosing uncoloured vertices to be coloured. Whenever an uncoloured vertex is chosen, it is coloured by the least positive integer not used by any of its coloured neighbours. Alice’s goal is to minimise the total number of colours used in the game, and Bob’s goal is to maximise it. The game Grundy number of G is the number of colours used in the game when both players use optimal strategies. It is proved in this paper that the maximum game Grundy number of forests is 3, and the game Grundy number of any partial 2-tree is at most 7.

Keywords

Colouring game Game Grundy number Trees Partial 2-trees 

References

  1. Bartnicki T, Grytczuk J, Kierstead HA, Zhu X (2007) The map colouring game. Am Math Mon 114(9):793–803 MathSciNetMATHGoogle Scholar
  2. Bodlaender HL (1991) On the complexity of some coloring games. Int J Found Comput Sci 2(2):133–147 MathSciNetCrossRefMATHGoogle Scholar
  3. Dunn C, Kierstead HA (2004a) A simple competitive graph coloring algorithm. II. J Comb Theory, Ser B 90(1):93–106 (dedicated to Adrian Bondy and USR Murty) MathSciNetCrossRefMATHGoogle Scholar
  4. Dunn C, Kierstead HA (2004b) A simple competitive graph coloring algorithm. III. J Comb Theory, Ser B 92(1):137–150 MathSciNetCrossRefMATHGoogle Scholar
  5. Faigle U, Kern U, Kierstead HA, Trotter WT (1993) On the game chromatic number of some classes of graphs. Ars Comb 35:143–150 MathSciNetMATHGoogle Scholar
  6. Gardner M (1981) Mathematical games. Sci Am April Google Scholar
  7. Guan DJ, Zhu X (1999) Game chromatic number of outerplanar graphs. J Graph Theory 30(1):67–70 MathSciNetCrossRefMATHGoogle Scholar
  8. He W, Hou X, Lih K-W, Shao J, Wang W, Zhu X (2002) Edge-partitions of planar graphs and their game coloring numbers. J Graph Theory 41(4):307–317 MathSciNetCrossRefMATHGoogle Scholar
  9. Kierstead HA (2000) A simple competitive graph coloring algorithm. J Comb Theory, Ser B 78(1):57–68 MathSciNetCrossRefMATHGoogle Scholar
  10. Kierstead HA, Trotter WT (1994) Planar graph coloring with an uncooperative partner. J Graph Theory 18(6):569–584 MathSciNetCrossRefMATHGoogle Scholar
  11. Kierstead HA, Trotter WT (2001) Competitive colorings of oriented graphs. Electron J Comb 8(2):12 (research paper, 15 pp (electronic). In honor of Aviezri Fraenkel on the occasion of his 70th birthday) MathSciNetGoogle Scholar
  12. Kierstead HA, Tuza Zs (2003) Marking games and the oriented game chromatic number of partial k-trees. Graphs Comb 19(1):121–129 MathSciNetCrossRefMATHGoogle Scholar
  13. Kierstead HA, Yang D (2004) Orderings on graphs and game coloring number. Order 20(3):255–264. 2003 MathSciNetCrossRefGoogle Scholar
  14. Kierstead HA, Yang D (2005) Very asymmetric marking games. Order 22(2):93–107 MathSciNetCrossRefMATHGoogle Scholar
  15. Nešetřil J, Sopena E (2001) On the oriented game chromatic number. Electron J Comb 8(2):14 (research paper, 13 pp (electronic). In honor of Aviezri Fraenkel on the occasion of his 70th birthday) Google Scholar
  16. Wu J, Zhu X (2008) Lower bounds for the game colouring number of partial k-trees and planar graphs. Discrete Math 308(12):2637–2642 MathSciNetCrossRefMATHGoogle Scholar
  17. Zhu X (2000) The game coloring number of pseudo partial k-trees. Discrete Math 215(1–3):245–262 MathSciNetCrossRefMATHGoogle Scholar
  18. Zhu X (2008a) The game coloring number of planar graphs. J Graph Theory 59:261–278 MathSciNetCrossRefMATHGoogle Scholar
  19. Zhu X (2008b) Refined activation strategy for the marking game. J Comb Theory, Ser B 98(1):1–18 CrossRefMATHGoogle Scholar
  20. Zhu X (2008c) Game coloring the Cartesian product of graphs. J Graph Theory 59(4):261–278 MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Projet MascotteI3S (CNRS, UNS) and INRIASophia AntipolisFrance
  2. 2.Department of MathematicsZhejiang Normal UniversityJinhuaChina

Personalised recommendations