The chromatic connectivity of graphs (Q1110536)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The chromatic connectivity of graphs |
scientific article; zbMATH DE number 4073017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic connectivity of graphs |
scientific article; zbMATH DE number 4073017 |
Statements
The chromatic connectivity of graphs (English)
0 references
1988
0 references
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.
0 references
chromatically k-connected graphs
0 references
vertex-cutset
0 references
chromatic number
0 references
