1952 search results - page 149 / 391 » Complete partitions of graphs |
165
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
150
click to vote
DAM
1999
15 years 4 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
125
click to vote
EJC
2007
15 years 4 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
140
click to vote
ENDM
2002
15 years 4 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
138
Voted
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...