Distance-2 Edge Coloring is NP-Complete

Details Distance-2 Edge Coloring is NP-Complete Distance-2 Edge Coloring is NP-Complete

2005-09-30

arxiv.org/abs/cs/0509100v1

Computer Science

Discrete Mathematics

3 pages, 1 figure in color

Scientific paper

We prove that it is NP-complete to determine whether there exists a
distance-2 edge coloring (strong edge coloring) with 5 colors of a bipartite
2-inductive graph with girth 6 and maximum degree 3.

Affiliated with

Also associated with

No associations

Rating

Distance-2 Edge Coloring is NP-Complete 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 Distance-2 Edge Coloring is NP-Complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance-2 Edge Coloring is NP-Complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682675