4171 search results - page 28 / 835 » Choice numbers of graphs |
SETN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
DEXA
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Due to the wide-spread use of decision support systems (DSS), methods are required by software companies. Several concepts and methods have been suggested for decision-ma...
DM
2010
13 years 8 months ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
ENDM
2000
13 years 8 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...