718 search results - page 40 / 144 » Coloring quasi-line graphs |
COMBINATORICS
2002
14 years 11 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...
147
click to vote
DAM
2011
14 years 6 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...
110
click to vote
ICIP
2010
IEEE
14 years 9 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)...
PERCOM
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i