347 search results - page 37 / 70 » Schaefer's theorem for graphs |
JSYML
2008
14 years 11 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
104
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
ER
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
131
click to vote
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
DAM
2008
14 years 12 months ago
2008
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...