Sciweavers

COCOON
2005
Springer
14 years 6 months ago
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 ...
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishize...