3 search results - page 1 / 1 » Ramsey-Type Results for Unions of Comparability Graphs |
GC
2002
Springer
13 years 4 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
DAWAK
2007
Springer
13 years 10 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
IANDC
2006
13 years 4 months ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...