1749 search results - page 23 / 350 » Conditional colorings of graphs |
144
click to vote
DAM
2010
15 years 4 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
149
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
137
click to vote
DM
2002
15 years 4 months ago
2002
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
135
click to vote
ISTCS
1993
Springer
15 years 8 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
129
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
The output from a color imaging sensor, or apparent color, can change considerably due to illumination conditions and scene geometry changes. In this work we take into account the...