Graphs without a 3-Connected Subgraph are 4-Colourable

Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott 0001, Paul D. Seymour, Stéphan Thomassé, Nicolas Trotignon. Graphs without a 3-Connected Subgraph are 4-Colourable. Electr. J. Comb., 32(1), 2025. [doi]

Abstract

Abstract is missing.