Below is a list the current schedlue of talks. For any problems with this schedule, please e-mail one of the conference organizers. CHECK THIS PAGE OFTEN!!! IT'S STILL EVOLVING!
| TIME | SPEAKER | TITLE | |
| 11:30 - 1:00 | Registration | Culp Center | |
| 12:00 - 12:10 | Dean of Arts and Sciences East Tennessee State University |
Introduction and Welcome | |
| 12:10 - 12:30 | Warren Shreve North Dakota State University | Graphic Sequences and Repetition Subsequences | |
| 12:35 - 12:55 | Frances Van Scoy West Virginia University |
Broadcasting in Dynamically Oriented Paths | |
| 1:00 - 1:20 | Niall Graham University of Alabama in Huntsville | Counting Self-avoiding Walks on Grids | |
| 1:25 - 1:45 | Terry McKee Wright State University |
New Characterizations of Strongly Chordal Graphs | |
| 1:45 - 2:00 | BREAK | ||
| 2:00 - 3:00 | Fred Roberts Rutgers University | On the Median Procedure | |
| 3:00 - 3:10 | BREAK | ||
| 3:10 - 3:30 | Kevin Phelps Auburn University |
Combinatorics of Perfect Codes | |
| 3:35 - 3:55 | Dean Hoffman Auburn University |
On the Trade Spectra of Complete Partite Graphs | |
| 4:00 - 4:20 | Pete Johnson Auburn University |
Relations among some Fractional Chromatic Graph Parameters | |
| 4:25 - 4:45 | Charlie Cooke Old Dominion University |
Parameter Sequences Which Guarantee Nonexistence of Generalized Hadamard Matrices $GH(g, \Lambda_k)$ Over Abelian Group G | |
| 4:50 - 5:10 | Nawarat Ananchuen Silpakorn University, Thailand | On Minimum Degree of Strongly k-Extendable Graphs | |
| 5:15 - 5:35 | Stanislaw Radziszowski Rochester Institute of Technology | Computation of the Folkman Number F(3,3;5) | |
| 5:40 - 6:00 | Allison Wolf Emory University |
$\chi-$Binding Functions on Graphs Determined by Forbidden Subgraphs |
| TIME | SPEAKER | TITLE |
| 8:00 - 9:30 | Registration and Refreshments | Culp Center |
| 8:10 - 8:30 | Matt Scobee University of Louisville |
A Characterization of the Orientations of Ternary Matroids |
| 8:35 - 8:55 | Nick Zhao | On the Edge Reconstruction of Graphs Embedded in Surfaces |
| 9:00 - 9:20 | Ralph Faudree University of Memphis |
$r(C_5,C_5,C_5) = 17$ |
| 9:25 - 9:45 | Guantao Chen Georgia State University |
Partitioning Vertices of a Graph into Disjoint Paths |
| 9:50 - 10:10 | Andre Kezdy University of Louisville |
Even Pairs in Diamond-Free Graphs |
| 10:15 - 10:35 | Jean Dunbar Converse College |
The Path(ological) Partition Conjecture |
| 10:40 - 11:00 | Carl Lee University of Kentucky |
Capacitated Monge Sequences |
| 11:05 - 11:25 | E. J. Cockayne University of Victoria |
Generalized Irredundance: Hereditary Properties and Ramsey Numbers |
| 11:30 - 11:50 | Doug Rall Furman University |
Acyclic Domination Numbers and Acyclic Irredundance Numbers |
| 11:50 - 1:30 | LUNCH | |
| 1:30 - 1:50 | Ben Phillips East Tennessee State University |
Generalized Vertex Critical Domination |
| 1:55 - 2:15 | Gayla Domke Georgia State University |
Gallai-type Theorems for Strong and Weak Domination Parameters |
| 2:15 - 2:35 | Johannes Hattingh Georgia State University |
On Weak Domination in Graphs II |
| 2:35 - 2:45 | BREAK | |
| 2:45 - 3:45 | Christina Mynhardt University of South Africa |
A Characterization of $(\gamma, i)-$Trees |
| 3:50 - 4:10 | BREAK | |
| 4:15 - 4:35 | Renn Laskar Clemson University |
Rankings of Graphs |
| 4:40 - 5:00 | Eric Trees University of Alabama in Huntsville | The Matrix Partition LP-Theorem |
| 5:05 - 5:25 | Saad El-Zanati Illinois State University |
On Graphs with Strong $\alpha-$Valuations |
| 6:00 | Wine and Cheese |
| TIME | SPEAKER | TITLE |
| 8:15 - 9:15 | Registration and Refreshments | Culp Center |
| 8:35 - 8:55 | Ralph Stanton University of Manitoba |
Minimal Pairwise-Balanced Designs with Pair Count Two |
| 9:00 - 9:20 | Dwight Duffus Emory University |
Set Systems and Distributive Lattices |
| 9:25 - 9:45 | Jill Faudree Emory University |
Hamiltonicity, $2-$Factors, and $k-$Cycles |
| 9:50 - 10:10 | Ron Gould Emory University | $k-$Ordered Graphs |
| 10:15 - 10:35 | Mike Plummer Vanderbilt University |
Restricted Matching Extension in Planar Graphs |
| 10:40 - 11:00 | W. D. Wallis Southern Illinois University | Where do all the One-Factorizations Come From? |
| 11:05 - 11:25 | Yubao Guo University of Aachen, Germany |
Complementary Cycles Containing Prescribed Vertices in Tournaments |
| 11:25 - 11:35 | BREAK | |
| 11:35 - 12:35 | Michael Henning University of Natal |
Bounds on Domination Parameters |
| 12:35 - 2:00 | LUNCH | |
| 2:00 - 2:20 | Mark Ginn Austin Peay State University |
Hybrid Genetic Algorithms for Graph Coloring |
| 2:25 - 2:45 | Fred Buckley Baruch College (CUNY) |
Distance and Graph Coloring |
| 2:50 - 3:10 | Bruce Landman University of NC at Greensboro | Some van der Waerden-like Functions |
| 3:15 - 3:35 | Jennifer Quinn Occidental College |
Fibonacci and Lucas Identities through Colored Tilings |
| 3:40 - 4:00 | Tristan Denley University of Mississippi |
On Arithmetic Progressions of Cycles in Graphs |
| 4:05 - 4:25 | Wilfried Imrich Syracuse University |
Median Graphs and Triangle Free Graphs |
| 4:30- 4:50 | Brad Dyer East Tennessee State University |
Algorithm for Optimal Triangulations and Implementation in MatLab |
Return to the Cumberland Conferences' home page