It is well known that a clique with k + 1 vertices is the only minimal obstruction to k-colourability of chordal graphs. A similar result is known for the existence of a cover by cliques. Both ofâ€¦ (More)

In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r -cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic to Kr , with noâ€¦ (More)

Given a set of objects O and a set of tests T , the abstract decision tree problem (DTP) is to construct a tree with minimum height that completely identi3es the objects of O, by using the tests of Tâ€¦ (More)