Graphs and Combinatorics

, Volume 11, Issue 3, pp 263–266

Critical 3-cochromatic graphs

  • Leif K. Jørgensen
Original Papers

Abstract

A (vertex-) critical 3-cochromatic graph is either an odd cycle, the complement of an odd cycle, or one of 42 graphs on 6 vertices.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Broere, I., Burger, M.; Critically cochromatic graphs. J. Graph Theory13, 23–28 (1989)Google Scholar
  2. 2.
    Erdös, P., Gimbel, J.; Some problems and results in cochromatic theory, Quo Vadis, Graph Theory?, Annals of Discr. Math.55, 261–264 (1993)Google Scholar
  3. 3.
    Gimbel, J., Straight, H.J.; Some topics in cochromatic theory. Graphs Combin.3, 255–265 (1987)Google Scholar
  4. 4.
    Lesniak-Foster, L., Straight, H.J.; The cochromatic number of a graph. Ars Combinatoria3, 39–45 (1977)Google Scholar
  5. 5.
    Straight, H.J.; Extremal problems concerning the cochromatic number of a graph. J. Indian Math. Soc. (N.S.)44, 137–142 (1980)Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Leif K. Jørgensen
    • 1
  1. 1.Dept. of Mathematics and Computer ScienceAalborg UniversityAalborg ØDenmark

Personalised recommendations