Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-23T03:02:16.701Z Has data issue: false hasContentIssue false
  • English
  • Français

Two graph-colouring games

Published online by Cambridge University Press:  17 April 2009

Frank Harary  and
Zsolt Tuza
Frank Harary
Affiliation:
Department of Computer Science, New Mexcico State University, Las Cruces NM 88003, United States of America
Zsolt Tuza
Affiliation:
Computer and Automation Institute Hungarian Academy of Sciences, H-1111 Budepest Kendu u. 13-17, Hungary
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We introduce two graph-colouring 2-person games, and analyse who has a winning strategy on some specific graphs such as the Petersen graph, and paths and cycles of given length.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 48 , Issue 1 , August 1993 , pp. 141 - 149
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]Biró, M., Hujter, M. and Tuza, Zs., ‘Precoloring extension I. Interval graphs’, Discrete Math. 100 (1992), 267–279.CrossRefGoogle Scholar
[2]Gyárfás, A. and Lehel, J., ‘On-line and first-fit colourings’, J. Graph Theory 12 (1988) 217–227.CrossRefGoogle Scholar
[3]Harary, F., Graph theory (Addison-Wesley, Reading, 1969).CrossRefGoogle Scholar
[4]Harary, F. and Leary, C., ‘Latin square achievement games’, J. Recreational Math. 16 (1983–1984), 241–246.Google Scholar
[5]Hujter, M. and Tuza, Zs., ‘Precoloring extension II. Graph classes related to bipartite graphs’, Acta Math. Univ. Comenian. (1993) (to appear).Google Scholar
[6]Hujter, M. and Tuza, Zs., ‘Precoloring extension III. Classes of perfect graphs’, (submitted).Google Scholar