Bonnet, Édouard, Feghali, C., Nguyen, T., Scott, A., Seymour, P., Thomassé, S., & Trotignon, N. (2025). Graphs without a 3-Connected Subgraph are 4-Colourable. The Electronic Journal of Combinatorics, 32(1), P1.26. https://doi.org/10.37236/13181