Hans L. Bodlaender  Home/Search
Context Related
| archive.cs.uu.nl/pub/RUU/...198927.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we consider the following game: players must alternately color the lowest numbered uncolored vertex of a given graph G = ({1, 2, ..., n), E) with a color, taken from a given set C, such that never two adjacent vertices are colored with the same color. In one variant, the first player which is unable to move, loses the game. In another variant, player 1 wins the game if and only if the game ends with all vertices colored. We show that for both variants, the problem to determine... (Update)
Context of citations to this paper: More
...is well defined since we clearly have (G) gcn(G) jV (G)j. The game chromatic number of a graph was first introduced by Bodlaender in [1] and then studied by Bodlaender and Kratsch [2] Faigle, Kern, Kierstead and Trotter [8] This work has been partially supported by the...
...is well de ned since we clearly have (G) gcn(G) jV (G)j. The game chromatic number of a graph was rst introduced by Bodlaender in [1] and then studied by Bodlaender and Kratsch [2] Faigle, Kern, Kierstead and Trotter [7] Kierstead and Trotter [11] Dinski and Zhu [5]...
Cited by: More
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (Correct)
Fast Algorithms for the TRON Game on Trees - Bodlaender, Kloks (1990) (Correct)
Carrying Umbrellas: An Online Relocation Game on a Graph - Lee, al. (Correct)
Active bibliography (related documents): More All
0.4: Computer Go: an AI Oriented Survey - Bouzy (2001) (Correct)
0.2: Traveling Salesmen in the Presence of Competition - Fekete, Fleischer (Correct)
0.2: Playing Games with Algorithms: Algorithmic Combinatorial Game.. - Demaine (2001) (Correct)
Similar documents based on text: More All
0.3: Edge Game Coloring of Graphs - Lam, Shiu, Xu (1999) (Correct)
0.2: On the Oriented Game Chromatic Number - Nesetril, Sopena (2000) (Correct)
0.2: Game Chromatic Number of Graphs - Dinski, Zhu (1998) (Correct)
Related documents from co-citation: More All
5: Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Cla.. (context) - Babai, Moran - 1988
5: Games against nature (context) - Papadimitriou - 1985
5: Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
BibTeX entry: (Update)
H. L. Bodlaender, On the Complexity of Some Coloring Games, Intl. J. Founds. Comp. Sci., 2 (1991), pp. 133-147. http://citeseer.ist.psu.edu/bodlaender89complexity.html More
@incollection{ bodlaender91complexity,
author = "Hans L. Bodlaender",
title = "On the Complexity of Some Coloring Games",
booktitle = "Graph-Theoretic Concepts in Computer Science (Proceedings of the 16th International Workshop {WG} '90, Berlin, Germany, June, 1990)",
volume = "484",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "R. H. M{\"o}hring",
pages = "30--40",
year = "1991",
url = "citeseer.ist.psu.edu/bodlaender89complexity.html" }
Citations (may not include all citations):686 A Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
144 The NP-completeness column: An ongoing guide (context) - Johnson - 1983
127 The complexity of satisfiability problems (context) - Schaefer - 1978
23 Provably difficult combinatorial games (context) - Stockmeyer, Chandra - 1979
22 the complexity of some two-person perfect-information games (context) - Schaefer - 1978
22 Black-white pebbles and graph separation (context) - Lengauer - 1981
21 Improved self-reduction algorithms for graphs with bounded t.. (context) - Bodlaender - 1988
16 A combinatorial problem which is complete in polyno- mial sp.. (context) - Even, Tarjan - 1976
15 Go is polynomial-space hard (context) - Lichtenstein, Sipset - 1980
13 Classes of graphs with bounded treewidth (context) - Bodlaender - 1986
7 Checkers is exptime complete (context) - Robson, by - 1984
6 Pspace-hardness of some combinatorial games (context) - Fraenkel, Goldschmidt - 1987
5 Computing a perfect strategy for n by n chess requires time .. (context) - Fraenkel, Lichtenstein - 1981
1 Some combinatorial game problems require (context) - Adachi, Iwata et al. - 1984
1 Efficiency of a good but not linear set _nion algorithm (context) - Tarjan - 1975
1 board -- preliminary version (context) - Fraenkel, Garey et al. - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC