9:00 - 9:10 Welcome
Bill Bauldry, Chairman of Department of Mathematical Sciences

9:10 - 9:30 Packing and Covering the Complete Graph with a Hole, $K(v,w)$, with 4-Cycles
Robert Gardner
East Tennessee State University

9:40 - 10:00 Knots, Links, and Graphs
Chris Campbell
Wake Forest University

10:10 - 10:30 Cyclicity of Products
Richard Hammack
Wake Forest University

Break

10:50 - 11:10 Complete Graphs under the (P3;"I")-transformation
Blayne Carroll
Berry College

11:20 - 11:40 The French Solitaire Puzzle
Glenn Altemose
Appalachian State University

11:50 - 12:10 An upper bound on hyper-ovals in Desarguesian projective planes
Joe DeMaio
Kennesaw State University

12:30 - 2:00 Luncheon with Keynote Speaker
Combinatorial Gray Codes
Carla Savage
North Carolina State University

2:20 - 2:40 A Fast Shortest-Path Algorithm
Alexander Gordon
University of North Carolina, Charlotte

2:50 - 3:10 The Mod Sum Number of Km,n
Chris Wallace
East Tennessee State University

Break

3:30 - 3:50 Domination Equivalence in Graphs
Steve Hedetniemi
Clemson University

4:00 - 4:20 Total Domination in Graphs
Michael Henning
University of Natal and East Tennessee State University

4:25 - 4:30 Closing Comments