Articles
Partitions of Graphs into Cographs

https://doi.org/10.1016/S1571-0653(04)00115-5Get rights and content

Abstract

Cographs from the minimal family of graphs containing K1 which are closed with respect to complements and unions. We discuss vertex partitions of graphs into the smallest number of cographs, where the partition is as small as possible. We shall call the order of such a partition the c-chromatic number of the graph. We begin by axiomatizing several well-known graphical parameters as motivation for this function. We present several bounds on c-chromatic number in terms of well-known expressions. We show that if a graph is triangle-free, then its chromatic number is bounded between the c-chromatic number and twice this number. We show both bounds are sharp, for graphs with arbitrarily high girth. This provides an alternative proof to a result in [3]; there exist triangle-free graphs with arbitrarily large c-chromatic numbers. We show that any planar graph with girth at least 11 has a c-chromatic number of at most two. We close with several remarks on computational complexity. In particular, we show that computing the c-chromatic number is NP-complete for planar graphs.

References (29)

  • I. Broere et al.

    Generalized colorings of graphs

  • G. Chartrand et al.
  • D.G. Corneil et al.

    Clustering and domination in perfect graphs

    Discrete Appl. Math

    (1984)
  • D.G. Corneil et al.

    A linear recognition algorithm for cographs

    SIAM J. Compt

    (1985)
  • Cited by (0)

    View full text