Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

EJC
2010

favoriteEmaildiscussreport

145views Information Technology» more EJC 2010»

Links in edge-colored graphs

13 years 4 months ago

Links in edge-colored graphs

Download www.lri.fr

A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,

J. M. Becu, M. Dah, Yannis Manoussakis, G. Mendy

Real-time Traffic

Conjectures | EJC 2007 | EJC 2010 | Pair Xi | Properly-edge-colored Version |

claim paper

Related Content

» Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

» Link scheduling in sensor networks distributed edge coloring revisited

» Transmission Scheduling in Sensor Networks via Directed Edge Coloring

» Algorithmic Aspects of Acyclic Edge Colorings

» Colored Trees in EdgeColored Graphs

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Algorithms for Finding DistanceEdgeColorings of Graphs

» Fast Heuristics for the Edge Coloring of Large Graphs

» Edge Coloring and Decompositions of Weighted Graphs

» EdgeColorings of Complete Graphs that Avoid Polychromatic Trees

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	EJC
Authors	J. M. Becu, M. Dah, Yannis Manoussakis, G. Mendy

Comments (0)