On the Complexity of Some Coloring Games

BODLAENDER, H. L. (1991). On the Complexity of Some Coloring Games. International Journal of Foundations of Computer Science, 2(2), 133-147.

Type

Journal article

Intellectual base

Primary research

Year

1991

DOI

10.1142/s0129054191000091

Link

https://doi.org/10.1142/S0129054191000091

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph Coloring Game
  • Bob attempts to create a position in which at least one uncolored vertex has neighbors displaying every available color and can no longer be legally colored.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:6fd632ada903 · see in the full table