\documentclass[12pt]{article}
\usepackage{fullpage,amsmath,amsfonts,graphicx}

\begin{document}

\title{General Mathematics and CPS II}
\author{Exercise 4}
\date{February 15, 2012}
\maketitle

\begin{enumerate}

\item Ivanov, p.\ 99, Problem 13.

\item Ivanov states the following famous theorem (p.\ 100, Theorem
11):

\emph{A finite connected graph is Eulerian (there is a chain
containing every edge) if and only if it has either two vertices of
odd valency or none.}

Write out a complete proof following the sketch given by Ivanov.

\end{enumerate}
\end{document}
