On the game chromatic number of sparse random graphs

Details On the game chromatic number of sparse random graphs On the game chromatic number of sparse random graphs

2011-12-30

arxiv.org/abs/1201.0046v1

Mathematics

Combinatorics

25 pages

Scientific paper

Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of $G$ are colored. The game chromatic number \chi_g(G) is the minimum k for which the first player has a winning strategy. The paper \cite{BFS} began the analysis of the asymptotic behavior of this parameter for a random graph G_{n,p}. This paper provides some further analysis for graphs with constant average degree i.e. np=O(1) and for random regular graphs.

Affiliated with

Also associated with

No associations

Rating

On the game chromatic number of sparse random graphs 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 On the game chromatic number of sparse random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the game chromatic number of sparse random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334658