The Complexity of Graph Ramsey Games.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cg/Slany00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cg/Slany00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wolfgang_Slany
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-45579-5%5F12
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-45579-5_12
>
dc:
identifier
DBLP conf/cg/Slany00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-45579-5%5F12
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
The Complexity of Graph Ramsey Games.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wolfgang_Slany
>
swrc:
pages
186-203
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cg/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cg/Slany00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cg/Slany00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cg/cg2000.html#Slany00
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-45579-5_12
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cg
>
dc:
subject
combinatorial games, graph Ramsey theory, Ramsey game, PSPACE-completeness, complexity, edge coloring, winning strategy, achievement game, avoidance game, the game of Sim, Java applet, endgames
(xsd:string)
dc:
title
The Complexity of Graph Ramsey Games.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document