BONNET, ÉDOUARD; FEGHALI, C.; NGUYEN, T.; SCOTT, A.; SEYMOUR, P.; THOMASSÉ, S.; TROTIGNON, N. Graphs without a 3-Connected Subgraph are 4-Colourable. The Electronic Journal of Combinatorics, v. 32, n. 1, p. P1.26, 28 Feb. 2025.