Distance-2 Edge Coloring is NP-Complete
Discrete Mathematics
2007-05-23 v1 Computational Complexity
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0509100,
title = {Distance-2 Edge Coloring is NP-Complete},
author = {Jeff Erickson and Shripad Thite and David P. Bunde},
journal= {arXiv preprint arXiv:cs/0509100},
year = {2007}
}
Comments
3 pages, 1 figure in color