Impartial coloring games

Details Impartial coloring games Impartial coloring games

2012-02-26

arxiv.org/abs/1202.5762v1

Mathematics

Combinatorics

Scientific paper

Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial rulesets (five new), derived from previously-studied graph coloring schemes, including proper map coloring, oriented coloring, 2-distance coloring, weak coloring, and sequential coloring. For each, we study the outcome classes for special cases and general computational complexity. In some cases we pay special attention to the Grundy function.

Affiliated with

Also associated with

No associations

Rating

Impartial coloring games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Impartial coloring games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Impartial coloring games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216078