Algorithms for Finding Distance-Edge-Colorings of Graphs

For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or an -edge-coloring of G. The distance-edge-coloring problem is to compute the minimum number of colors required for a distance-edge-coloring of a given graph G. A partial k-tree is a graph with tree-width bounded by a fixed constant k. We first present a polynomial-time exact algorithm to solve the problem for partial k-trees, and then give a polynomial-time 2-approximation algorithm for planar graphs.

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
• Keywords: COCOON 2005, Partial K-trees, Polynomial-time 2-approximation Algorithm, Polynomial-time Exact Algorithm