Hajós' graph-coloring conjecture: Variations and counterexamples

82Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

For each integer n ≥ 7, we exhibit graphs of chromatic number n that contain no subdivided Kn as a subgraph. However, we show that a graph with chromatic number 4 contains as a subgraph a subdivided K4 in which each triangle of the K4 is subdivided to form an odd cycle. © 1979.

Cite

CITATION STYLE

APA

Catlin, P. A. (1979). Hajós’ graph-coloring conjecture: Variations and counterexamples. Journal of Combinatorial Theory, Series B, 26(2), 268–274. https://doi.org/10.1016/0095-8956(79)90062-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free