2 A graph is shown below.
\includegraphics[max width=\textwidth, alt={}, center]{c4755464-aa15-4720-8f33-5eb7169f4a20-2_522_810_1637_246}
- Write down a cycle through all six vertices.
- Write down a continuous route that uses every arc exactly once.
- Use Kuratowski's theorem to show that the graph is not planar.
- Show that the graph has thickness 2 .