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]

@article{BonnetFNSSTT25,
  title = {Graphs without a 3-Connected Subgraph are 4-Colourable},
  author = {Édouard Bonnet and Carl Feghali and Tung Nguyen and Alex Scott 0001 and Paul D. Seymour and Stéphan Thomassé and Nicolas Trotignon},
  year = {2025},
  doi = {10.37236/13181},
  url = {https://doi.org/10.37236/13181},
  researchr = {https://researchr.org/publication/BonnetFNSSTT25},
  cites = {0},
  citedby = {0},
  journal = {Electr. J. Comb.},
  volume = {32},
  number = {1},
}