Premium
Characterization of maximum critically 2‐connected graphs
Author(s) -
Entringer R. C.
Publication year - 1978
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190020406
Subject(s) - combinatorics , mathematics , graph , connectivity , connected component , discrete mathematics , strongly connected component
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.