The complexity of graph Ramsey games

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationComputers and Games
Place of PublicationBerlin [u.a.]
PublisherSpringer
Pages186-203
Volume2063
ISBN (Print)978-3-540-43080-3
Publication statusPublished - 2001
EventInternational Conference on Computers and Games - Hamamatsu, Japan
Duration: 26 Oct 200028 Oct 2000

Publication series

NameLecture notes in computer science
PublisherSpringer

Conference

ConferenceInternational Conference on Computers and Games
CountryJapan
CityHamamatsu
Period26/10/0028/10/00

Treatment code (Nähere Zuordnung)

  • Application
  • Theoretical
  • Experimental

Cite this

Slany, W. (2001). The complexity of graph Ramsey games. In Computers and Games (Vol. 2063, pp. 186-203). (Lecture notes in computer science). Berlin [u.a.]: Springer.

The complexity of graph Ramsey games. / Slany, Wolfgang.

Computers and Games. Vol. 2063 Berlin [u.a.] : Springer, 2001. p. 186-203 (Lecture notes in computer science).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Slany, W 2001, The complexity of graph Ramsey games. in Computers and Games. vol. 2063, Lecture notes in computer science, Springer, Berlin [u.a.], pp. 186-203, International Conference on Computers and Games, Hamamatsu, Japan, 26/10/00.
Slany W. The complexity of graph Ramsey games. In Computers and Games. Vol. 2063. Berlin [u.a.]: Springer. 2001. p. 186-203. (Lecture notes in computer science).
Slany, Wolfgang. / The complexity of graph Ramsey games. Computers and Games. Vol. 2063 Berlin [u.a.] : Springer, 2001. pp. 186-203 (Lecture notes in computer science).
@inproceedings{f99ca7602ab84457a532944f892bfafd,
title = "The complexity of graph Ramsey games",
author = "Wolfgang Slany",
year = "2001",
language = "English",
isbn = "978-3-540-43080-3",
volume = "2063",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "186--203",
booktitle = "Computers and Games",

}

TY - GEN

T1 - The complexity of graph Ramsey games

AU - Slany, Wolfgang

PY - 2001

Y1 - 2001

UR - http://www.springerlink.com/content/qlqfqab49uynxubv/fulltext.pdf

M3 - Conference contribution

SN - 978-3-540-43080-3

VL - 2063

T3 - Lecture notes in computer science

SP - 186

EP - 203

BT - Computers and Games

PB - Springer

CY - Berlin [u.a.]

ER -