8:00 a.m. Full Domination in Graphs. Robert C Brigham, Univeristy of Central Florida
Gary Chartrand, Western Michigan University
Ronald D Dutton, University of Central Florida
Ping Zhang*, Western Michigan University
(950-05-709)
8:30 a.m. On Minimal Ultimately Economical Supergraphs. Curtis Clark*, Morehouse College
(950-05-1169)
9:00 a.m. Monotone Reachability in Arc Colored Tournaments. K. B. Reid*, California State University San Marcos
(950-05-979)
9:30 a.m. On the Planarity of Iterated Jump Graphs. Gary Chartrand*, Western Michigan University
Heather Gavlas, Grand Valley State University
Hector Hevia, Universidad Adolfo Ibanez, Vina del Mar, Chile
Donald W VanderJagt, Grand Valley State University
Ping Zhang, Western Michigan University
(950-05-715)
10:00 a.m. Critical and Stable Graphs with Total Irredundance of Zero. Teresa W Haynes, East Tennessee State University
Steve Hedetniemi, Clemson University
Michael Henning, University of Natal
Debra J Knisley*, East Tennessee State University
(950-05-978)
10:30 a.m. Excellent Graphs. Gerd H Fricke, Wright State University
Teresa W Haynes*, East Tennessee State University
Sandee S Hedetniemi, Clemson University
Stephen T Hedetniemi, Clemson University
Renu C Laskar, Clemson University
(950-05-857)
4:00 p.m. Strong Distance in Strong Oriented Graphs. Gary T Chartrand, Western Michigan University
David J Erwin, Western Michigan University
Michael E Raines*, Western Michigan University
Ping Zhang, Western Michigan University
(950-05-971)
4:30 p.m. The Peripheral Appendage Number of Edge-Deleted Graphs. Steven J Winters*, University of Wisconsin Oshkosh
(950-05-605)
5:00 p.m. $(a:b)$-choosability: Beauty from Ugliness. Glenn G Chappell*, Southeast Missouri State University
(950-05-912)
5:30 p.m. "Colorful" trees in edge-colorings of graphs. Tao Jiang*, University of Illinois at Urbana-Champaign
(950-05-724)
1:00 p.m. Coloring Numbers for Knots and Links. Louis H Kauffman*, Univ of Illinois at Chicago
Frank Harary, New Mexico State Univ
(950-57-60)
1:30 p.m. On the Shields-Harary Number of a Graph. Frank Harary, New Mexico State University
Peter D. Johnson, Jr.*, Auburn University
(950-05-271)
2:00 p.m. Generalized Vertex Covers in Graphs. Stephen T Hedetniemi*, Clemson University
(950-05-868)
2:30 p.m. On the fault-tolerance of meshes. Daniela Ferrero*, Academia Sinica
(950-05-753)
3:00 p.m. Complete Families of Graphs. Ralph Faudree, University of Memphis
Ronald Gould, Emory University
Michael Jacobson, University of Louisville
Linda Lesniak*, Drew University
(950-05-1041)