#### Filter Results:

#### Publication Year

1992

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A graph G is (a, b)-choosable if for any assignment of a list of a colors to each of its vertices there is a subset of b colors of each list so that subsets corresponding to adjacent vertices are disjoint. It is shown that for every graph G, the minimum ratio a/b where a, b range over all pairs of integers for which G is (a, b)-choosable is equal to the… (More)

A k-dominating set is a set D k V such that every vertex i 2 V nD k has at least k i neighbours in D k. The k-domination number k (G) of G is the cardinality of a smallest k-dominating set of G. For k 1 = ::: = kn = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number… (More)

- M Voigt
- 1998

We consider the following type of problems. Given a graph G = (V; E) and lists L(v) of allowed colors for its vertices v 2 V such that jL(v)j = p for all v 2 V and jL(u) \ L(v)j c for all uv 2 E, is it possible to nd a \list coloring", i.e., a color f (v) 2 L(v) for each v 2 V , so that f (u) 6 = f (v) for all uv 2 E ? We prove that every graph of maximum… (More)

Computing the chromatic number of a graph is an NP-hard problem. For random graphs and some other classes of graphs, esti-mators of the expected chromatic number have been well studied. In this paper, a new 0–1 integer programming formulation for the graph coloring problem is presented. The proposed new formulation is used to develop a method that generates… (More)