43 search results - page 4 / 9 » Vertex Cover in Graphs with Locally Few Colors |
SOICT
2010
13 years 1 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
LATIN
2004
Springer
13 years 11 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
ESA
2008
Springer
13 years 8 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...
DAM
2008
13 years 6 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...