On the complexity of some coloring games

Hans Bodlaender

doi:10.1007/3-540-53832-1_29

On the complexity of some coloring games

Utrecht University

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

Original language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science
Subtitle of host publication	16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings
Editors	Rolf H. Möhring
Publisher	Springer
Pages	30-40
Number of pages	11
Volume	484
ISBN (Electronic)	978-3-540-46310-8
ISBN (Print)	978-3-540-53832-5
DOIs	https://doi.org/10.1007/3-540-53832-1_29
Publication status	Published - 1991
Externally published	Yes
Event	International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90 - Berlin, Germany Duration: 20 Jun 1990 → 22 Jun 1990

Publication series

Name	Lecture Notes in Computer Science

Conference

Conference	International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90
Country/Territory	Germany
City	Berlin
Period	20/06/90 → 22/06/90

Access to Document

10.1007/3-540-53832-1_29

http://dx.doi.org/10.1007/3-540-53832-1_29

Cite this

@inbook{01b0df5f6b4949b7b86493a4081096e1,

title = "On the complexity of some coloring games",

author = "Hans Bodlaender",

year = "1991",

doi = "10.1007/3-540-53832-1_29",

language = "English",

isbn = "978-3-540-53832-5",

volume = "484",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "30--40",

editor = "M{\"o}hring, {Rolf H.}",

booktitle = "Graph-Theoretic Concepts in Computer Science",

note = "International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90 ; Conference date: 20-06-1990 Through 22-06-1990",

}

Bodlaender, H 1991, On the complexity of some coloring games. in RH Möhring (ed.), Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings. vol. 484, Lecture Notes in Computer Science, Springer, pp. 30-40, International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90, Berlin, Germany, 20/06/90. https://doi.org/10.1007/3-540-53832-1_29

On the complexity of some coloring games. / Bodlaender, Hans.
Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings. ed. / Rolf H. Möhring. Vol. 484 Springer, 1991. p. 30-40 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

TY - CHAP

T1 - On the complexity of some coloring games

AU - Bodlaender, Hans

PY - 1991

Y1 - 1991

U2 - 10.1007/3-540-53832-1_29

DO - 10.1007/3-540-53832-1_29

M3 - Chapter

SN - 978-3-540-53832-5

VL - 484

T3 - Lecture Notes in Computer Science

SP - 30

EP - 40

BT - Graph-Theoretic Concepts in Computer Science

A2 - Möhring, Rolf H.

PB - Springer

T2 - International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90

Y2 - 20 June 1990 through 22 June 1990

ER -