Bonnet, Édouard, Carl Feghali, Tung Nguyen, Alex Scott, Paul Seymour, Stéphan Thomassé, and Nicolas Trotignon. “Graphs Without a 3-Connected Subgraph Are 4-Colourable”. The Electronic Journal of Combinatorics 32, no. 1 (February 28, 2025): P1.26. Accessed March 29, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i1p26.