1749 search results - page 139 / 350 » Conditional colorings of graphs |
133
click to vote
DM
2002
15 years 6 months ago
2002
In this paper, we present several conditions for K1,3-free graphs, which guarantee the graph is subpancyclic. In particular, we show that every K1,3-free graph with minimum degree...
180
click to vote
RSA
2008
15 years 6 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
193
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
229
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
207
click to vote
PAMI
2011
15 years 1 months ago
2011
—A majority of the existing stereo matching algorithms assume that the corresponding color values are similar to each other. However, it is not so in practice as image color valu...