Graphs and Combinatorics

, Volume 3, Issue 1, pp 255–265

Some topics in cochromatic theory

  • John Gimbel
  • H. Joseph Straight
Article

DOI: 10.1007/BF01788548

Cite this article as:
Gimbel, J. & Straight, H.J. Graphs and Combinatorics (1987) 3: 255. doi:10.1007/BF01788548

Abstract

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.

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • John Gimbel
    • 1
  • H. Joseph Straight
    • 2
  1. 1.Colby CollegeWatervilleUSA
  2. 2.State University of New York at FredoniaFredoniaUSA

Personalised recommendations