Graphs without a 3-connected subgraph are 4-colorable

Year: 2024

Type: preprint

Abstract: In 1972, Mader showed that every graph without a 3-connected subgraph is 4-degenerate and thus 5-colorable}. We show that the number 5 of colors can be replaced by 4, which is best possible.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2402.06338

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

Institutions: École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Laboratoire de l'Informatique du Parallélisme, Princeton University, University of Oxford

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Princeton University, Agence Nationale de la Recherche, Université de Lyon, Horizon 2020 Framework Programme, Engineering and Physical Sciences Research Council, Air Force Office of Scientific Research

OpenAlex ID: W4391766715