Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results concerning maximal (vertex- or edge-) connectivity. Next, we deal with conditions for having (usually lower) bounds for the connectivity parameters. Finally, some other general connectivity measures, such as one instance of the so-called “conditional connectivity,” are considered.
For unexplained terminology concerning connectivity, see §4.1.
CitacióBalbuena, M.; Fàbrega, J.; Fiol, M. Further topics in connectivity. A: "Handbook of Graph Theory, Second Edition". CRC Press Taylor & Francis Group, 2013, p. 360-397.