Characterization of maximum critically 2‐connected graphs
Roger C. Entringer · Journal of Graph Theory · 1978
Abstract A graph G is critically 2‐connected if G is 2‐connected but, for any point p of G, G — p is not 2‐connected. Critically 2‐connected graphs on n points that have the maximum number of lines are characterized and shown to be unique for n ⩾ 3, n ≠ 11.