The complexity of nonrepetitive edge coloring of graphs

Details The complexity of nonrepetitive edge coloring of graphs The complexity of nonrepetitive edge coloring of graphs

2007-09-27

arxiv.org/abs/0709.4497v2

Computer Science

Computational Complexity

Scientific paper

A squarefree word is a sequence $w$ of symbols such that there are no strings $x, y$, and $z$ for which $w=xyyz$. A nonrepetitive coloring of a graph is an edge coloring in which the sequence of colors along any open path is squarefree. We show that determining whether a graph $G$ has a nonrepetitive $k$-coloring is $\Sigma_2^p$-complete. When we restrict to paths of lengths at most $n$, the problem becomes NP-complete for fixed $n$.

Affiliated with

Also associated with

No associations

Rating

The complexity of nonrepetitive edge 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 The complexity of nonrepetitive edge coloring of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of nonrepetitive edge coloring of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-714562