Graphs without a 3-connected subgraph are 4-colourable

DOI10.37236/13181MaRDI QIDQ7016786zbMATH OpenFDO

Authors Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul Seymour, Stéphan Thomassé, Nicolas Trotignon

Publication date 6 March 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13181

zbMATH Keywords

4-degenerate subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites work

• Dynamic cage survey
• Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
• Highly Connected Subgraphs with Large Chromatic Number
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)

This page was built for publication: Graphs without a 3-connected subgraph are 4-colourable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016786)