Distance-2 Edge Coloring is NP-Complete

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
3 pages, 1 figure in color

Keywords

Discrete Mathematics, Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/95157

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0509100
 http://arxiv.org/abs/cs/0509100

Collections

arXiv