Euler circuit, Hamilton cycle

1. Is there any graph $G$ with $\kappa(G) < \lambda(G) < \delta(G)$?

2. Is there a graph which has a Euler circuit but no Hamilton Cycle?

$\kappa(G)$ is the vertex connectivity, $\lambda(G)$ is the edge connectivity and $\delta(G)$ is the minimum degree.

-
I don't know the standard notation in this case, please edit it if these changes aren't right. – Ian Mateus Nov 16 '13 at 18:09