2.9 Coloring & Connectivity

Which of the following statements is valid?

Exercise 1

  k-edge-connected IMPLIES k-vertex-connected k-vertex-connected IMPLIES k-edge-connected k-edge-connected IFF k-vertex-connected k-edge-connected IMPLIES (k+1)-edge-connected k-vertex-connected IMPLIES k-edge-connected 

The complete graph on n vertices is _____.

Exercise 2

  n/2-connected n-connected (n-1)-connected 1-connected not connected (n-1)-connected