The Mapmaker's dilemma (Q1182308): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jozef Fiamčik / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jozef Fiamčik / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Effective coloration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Mapmaker's dilemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of finding the chromatic number of a recursive graph. I: The bounded case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded query classes and the difference hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive coloration of countable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3903002 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ``Global'' graph problems tend to be intractable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040892 / rank | |||
Normal rank |
Revision as of 14:57, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Mapmaker's dilemma |
scientific article |
Statements
The Mapmaker's dilemma (English)
0 references
28 June 1992
0 references
New type of game with two players, named the Mapmaker and the Explorer, is considered. The Mapmaker tries to colour \(n\) vertices of a \(k\)- colourable graph, while the Explorer reveals more and more of the graph; the Explorer wins if he can force the Mapmaker to change his mind many times. There is shown that for \(3\leq k\leq n\) the Explorer has a winning strategy. The Mapmaker has a winning strategy for \(k=2\). Applications to NP complexity, recursive graph theory and some open problems are given.
0 references
graph colouring
0 references
game with two players
0 references
0 references