300 search results - page 1 / 60 » List colorings with measurable sets |
JGT
2008
13 years 7 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
For the RISM A/II collection of musical incipits (short extracts of scores, taken from the beginning), we have established a ground truth based on the opinions of human experts. I...
TALG
2008
13 years 7 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in