On Dynamic Coloring of Graphs

Details On Dynamic Coloring of Graphs On Dynamic Coloring of Graphs

2009-08-18

arxiv.org/abs/0908.2543v1

Mathematics

Combinatorics

Scientific paper

A dynamic coloring of a graph $G$ is a proper coloring such that for every vertex $v\in V(G)$ of degree at least 2, the neighbors of $v$ receive at least 2 colors. In this paper we present some upper bounds for the dynamic chromatic number of graphs. In this regard, we shall show that there is a constant $c$ such that for every $k$-regular graph $G$, $\chi_d(G)\leq \chi(G)+ c\ln k +1$. Also, we introduce an upper bound for the dynamic list chromatic number of regular graphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8555