The chromatic connectivity of graphs (Q1110536)

A graph G is chromatically k-connected iff every vertex-cutset induces a subgraph of G with chromatic number at least k. The authors prove that each planar \(K_ 4\)-free graph is at most chromatically 2-connected and show that a \(K_ 5\)-free graph which can be embedded on the torus is at most chromatically 3-connected.