Algorithms for finding distance-edge-colorings of graphs

Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)798-807
Number of pages10
JournalLecture Notes in Computer Science
Publication statusPublished - 2005
Event11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China
Duration: 2005 Aug 162005 Aug 29


Dive into the research topics of 'Algorithms for finding distance-edge-colorings of graphs'. Together they form a unique fingerprint.

Cite this