… Cographs form the minimal family of graphs containing K 1 … partitions of graphs into the
smallest number of cographs. We … of such a partition the c -chromatic number of the graph. We …

… Cographs form the minimal family of graphs containing K1 which are closed with respect to
… vertex partitions of graphs into the smallest number of cographs, where the partition is as …

… graph G , we consider partitions of the vertex set of G into j + k parts where j of these parts
induce empty graphs … some computational questions related to chordal graphs and cographs. …

… partitions such that each partite set induces a graph with a given structure. Cographs form
the minimal family of graphs … Cographs are also characterized as the graphs containing no …

… Ordinary colourings of cographs are well understood; we focus on more general colourings,
known as matrix partitions. We show that all matrix partition problems for cographs admit …

… We consider the problem of partitioning a graph into k independent sets and l cliques, known
as the (k, l)-partition problem, which was introduced by Brandstädt in [1], and generalized …

… We consider the problem of partitioning the node set of a graph into p cliques and k stable
sets, namely the ( p , k ) -coloring problem. Results have been obtained for general graphs […

… In this paper the problems to partition a given graph into a … of this analysis of graph partition
problems is given by practical … constant k’ we can use the recursive structure of the cograph. …

… In Section 4, we characterize k-convex cographs and also cographs which have a quasi-clique
convex k-partition. A polynomial time algorithm for deciding if a cograph is k-convex is …

… concept of a convex partition of graphs. If there exists a partition of V ( G ) into p convex sets
… We show that it can be verified in linear-time if a cograph is p -convex for any value of p . For …