<div dir="ltr"><p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Verdana,sans-serif">Dear All,</span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Arial,sans-serif">&nbsp;</span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Verdana,sans-serif">Please
attend </span><span style="font-size:12pt;font-family:Verdana,sans-serif">Christodoulos
Mitillos</span><span style="font-size:12pt;font-family:Verdana,sans-serif">&rsquo;s Comprehensive
Exam.</span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Arial,sans-serif">&nbsp;</span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Verdana,sans-serif">When: Thursday,
April 10, 2014, 2:00 &ndash; 3:00 pm </span><span style="font-size:12pt;font-family:Arial,sans-serif"></span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Verdana,sans-serif">Where: E1
027</span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-size:12pt;font-family:Arial,sans-serif">&nbsp;</span></p>

<h1><span style="font-size:16pt;font-family:Verdana,sans-serif">Title: On Graph Fall-Colouring</span><span style="font-size:16pt;font-family:Verdana,sans-serif"></span></h1>

<p class="MsoNormal" style="background-repeat:initial initial"><span style="font-family:Arial,sans-serif"><br>
</span><span style="font-family:Verdana,sans-serif">Abstract</span><span style="font-size:10pt;line-height:115%;font-family:Verdana,sans-serif">:</span><span style="font-size:10pt;line-height:115%;font-family:Verdana,sans-serif">&nbsp;</span><span style="font-family:Verdana,sans-serif">Graph fall-colouring is an intersection of graph colouring and
graph domination, whereby we attempt to partition a graph into independent
dominating sets.</span></p>

<p class="MsoNormal" style="margin-bottom:0.0001pt"><span style="font-family:Verdana,sans-serif">In this talk, we will see various results regarding this type of
graph coloring, including constructions of fall-colourable graphs with certain
predefined properties.</span></p>

<p class="MsoNormal" style="margin-bottom:12pt"><span style="font-family:Verdana,sans-serif">Additionally, we
will present some results, which suggest that fall-colouring may be useful in
proving Hedetniemi&#39;s Conjecture.</span></p></div>