Graphs without a 3-connected subgraph are 4-colourable
Résumé
In 1972, Mader showed that every graph without a 3-connected subgraph is 4-degenerate and thus 5-colourable. We show that the number 5 of colours can be replaced by 4, which is best possible.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|