% Chris Hanusa
% chanusa@qc.cuny.edu	
\documentclass[12pt]{article} 

\usepackage{amssymb,amsthm,amsmath,epsfig}

\usepackage{color}
\definecolor{darkblue}{rgb}{0, 0, .4}
\definecolor{grey}{rgb}{.7, .7, .7}

\setlength{\topmargin}{-.5in}
\setlength{\textheight}{9in}
\setlength{\textwidth}{6.5in}
%\setlength{\headheight}{26pt}
%\setlength{\headsep}{2pt}
\setlength{\oddsidemargin}{0in}
\setlength{\evensidemargin}{0in}

\newcommand{\lam}{\lambda}

\usepackage[breaklinks]{hyperref} 
\hypersetup{
    colorlinks=true,
    linkcolor=darkblue,
    anchorcolor=darkblue,
    citecolor=darkblue,
    pagecolor=darkblue,
    urlcolor=darkblue,
    pdftitle={},
    pdfauthor={}
}

\begin{document}
\pagestyle{empty}



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{center}\large 
MATH 634, Spring 2014

{\sc Homework 7}

due 5:00{\sc pm} on Monday, February 24.
\end{center}

\noindent
{\em Background reading:} {\em Pearls in Graph Theory}, Section 3.1.

\smallskip\noindent
{\color{red} Follow the posted homework guidelines when completing this assignment.}

\smallskip\noindent
Problems {\bf 7D}, {\bf 7E}, and {\bf 7P} should be typed (or written up) and handed in as class starts on Monday 2/24:

\begin{enumerate}
\item[\bf 7D.]  

\begin{itemize}
\item cycle decomposition of a graph
\item (closed) knight's tour
\item walk
\item Eulerian circuit
\item Sierpinski Graph of order $n$.
\end{itemize}


\item[\bf 7E.]
Find a decomposition of the Gr\"otzsch graph into the smallest possible number of paths.  Give a justification why this is as small as possible.


\item[\bf 7P.] 
Determine the chromatic number and edge chromatic number of the Sierpinski Graph of order $n$. Prove your result by induction.

\end{enumerate}

\end{document}














