2310 search results - page 71 / 462 » Coloring Random Graphs |
111
click to vote
JCT
2007
15 years 4 months ago
2007
We prove that every planar graph with n vertices has at least 2n/9 distinct list-colorings provided every vertex has at least five available colors. © 2006 Elsevier Inc. All rig...
136
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
197
Voted
DAM
2011
14 years 11 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
125
click to vote
ARSCOM
2004
15 years 4 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
152
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a new algorithm for segmenting video frames into temporally stable colored regions, applying our technique to create artistic stylizations (e.g. cartoons and paintings)...