Graphs without a 3-connected subgraph are 4-colourable (Q7016786)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8005233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs without a 3-connected subgraph are 4-colourable |
scientific article; zbMATH DE number 8005233 |
Statements
Graphs without a 3-connected subgraph are 4-colourable (English)
0 references
6 March 2025
0 references
4-degenerate subgraphs
0 references
