GivenG, a graph, the cochromatic number,Z(G), ofG is the fewest number of sets into which the vertex set can be partitioned so that each set induces a complete or an empty graph. A graph is critically cochromatic if the removal of any of its vertices decreases its cochromatic number. A graph is uniquely cochromatic if there is exactly one partition of minimum order in which each set induces a complete or an empty graph. A graph is comaximal if the removal of any edge increases its cochromatic number. These and related concepts are examined.
KeywordsRelated Concept Minimum Order Empty Graph
Unable to display preview. Download preview PDF.
- 1.Chartrand, G., Lesniak, L.: Graphs and Digraphs, 2nd ed. Belmont, CA: Wadsworth 1986Google Scholar
- 2.Chartrand, G., Geller, D.: On uniquely colorable planar graphs. J. Comb. Theory6, 271–278 (1969)Google Scholar
- 3.Foldes, S., Hammer, P.: Split Graphs. Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing. Winnepeg, Manitoba: Utilatas Mathematica 1977Google Scholar
- 4.Gimbel, J.: The chromatic and cochromatic number of a graph. Doctoral dissertation, Western Michigan University. Kalamazoo, MI 1984Google Scholar
- 5.Harary, F., Thomassen, C.: Anticritical graphs. Math. Proc. Comb. Philos. Soc.79, 11–18 (1976)Google Scholar
- 6.Lesniak, L., and Straight, H.: The cochromatic number of a graph. Ars Comb.3, 39–46 (1977)Google Scholar
- 7.Straight, H.: Cochromatic number and the genus of a graph. J. Graph Theory.3, 43–51 (1979)Google Scholar