45 search results - page 1 / 9 » Coloring Weighted Series-Parallel Graphs |
ISAAC
2001
Springer
14 years 29 days ago
2001
Springer
INFORMATICASI
2006
13 years 8 months ago
2006
COMBINATORICS
1999
13 years 8 months ago
1999
ICALP
2011
Springer
12 years 12 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ESA
2008
Springer
13 years 10 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...