Department of

July 2014 August 2014 September 2014 Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa 1 2 3 4 5 1 2 1 2 3 4 5 6 6 7 8 9 10 11 12 3 4 5 6 7 8 9 7 8 9 10 11 12 13 13 14 15 16 17 18 19 10 11 12 13 14 15 16 14 15 16 17 18 19 20 20 21 22 23 24 25 26 17 18 19 20 21 22 23 21 22 23 24 25 26 27 27 28 29 30 31 24 25 26 27 28 29 30 28 29 30 31

Tuesday, August 26, 2014

**Abstract:** I will discuss three graph coloring problems. I will first discuss bounds on the maximum 3-dynamic chromatic number of planar graphs; this is joint work with Thomas Mahoney, Benjamin Reiniger, and Jennifer Wise. Next, I'll talk about some ongoing research on backbone coloring of planar graphs. Finally, I'll talk about finding an I,F-partition in sparse graphs.