1749 search results - page 129 / 350 » Conditional colorings of graphs |
179
click to vote
DAM
2007
15 years 6 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
176
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
153
click to vote
DM
2008
15 years 6 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
199
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Recently, the W3C Linking Open Data effort has boosted the publication and inter-linkage of large amounts of RDF datasets on the Semantic Web. Various ontologies and know...
188
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...