18 search results - page 1 / 4 » Strong edge-coloring of graphs with maximum degree 4 using 2... |
DM
2006
13 years 4 months ago
2006
In 1985, Erdos and Ne
ALGORITHMICA
2008
13 years 5 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
ALGORITHMICA
2002
13 years 4 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...