Our definition of k-connectedness, given in Chapter 1.4, is somewhat unintuitive. It does not tell us much about ‘connections’ in a k-connected graph: all it says is that we need at least k vertices to disconnect it. The following definition – which, incidentally, implies the one above – might have been more descriptive: ‘a graph is k-connected if any two of its vertices can be joined by k independent paths’.