Conditional and Unique Coloring of Graphs

Details Conditional and Unique Coloring of Graphs Conditional and Unique Coloring of Graphs

2011-06-17

arxiv.org/abs/1106.3456v1

Computer Science

Discrete Mathematics

Under review in International Journal of Computer Mathematics

Scientific paper

For integers $k, r > 0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to at least $\min\{r, d(v)\}$ differently colored vertices. Given $r$, the smallest integer $k$ for which $G$ has a conditional $(k,r)$-coloring is called the $r$th order conditional chromatic number $\chi_r(G)$ of $G$. We give results (exact values or bounds for $\chi_r(G)$, depending on $r$) related to the conditional coloring of some graphs. We introduce \emph{unique conditional colorability} and give some related results. (Keywords. cartesian product of graphs; conditional chromatic number; gear graph; join of graphs.)

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695889