Graphs that do not contain a cycle with a node that has at least two neighbors on it

Pierre Aboulker, Marko Radovanović, Nicolas Trotignon +1

We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected…