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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Broere, I., Burger, M.; Critically cochromatic graphs. J. Graph Theory13, 23–28 (1989)
Erdös, P., Gimbel, J.; Some problems and results in cochromatic theory, Quo Vadis, Graph Theory?, Annals of Discr. Math.55, 261–264 (1993)
Gimbel, J., Straight, H.J.; Some topics in cochromatic theory. Graphs Combin.3, 255–265 (1987)
Lesniak-Foster, L., Straight, H.J.; The cochromatic number of a graph. Ars Combinatoria3, 39–45 (1977)
Straight, H.J.; Extremal problems concerning the cochromatic number of a graph. J. Indian Math. Soc. (N.S.)44, 137–142 (1980)
Author information
Authors and Affiliations
Additional information
Research supported by the Danish Natural Science Research Council
Rights and permissions
About this article
Cite this article
Jørgensen, L.K. Critical 3-cochromatic graphs. Graphs and Combinatorics 11, 263–266 (1995). https://doi.org/10.1007/BF01793013
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01793013