10:00 a.m. On Cycle - Saturated Graphs. Ronald J Gould*, Emory University
Tomasz Luczak, Adam Mickiewicz University
John Schmitt, Middlebury College
(1025-05-31)
3:00 p.m. Pebbling and optimal pebbling numbers of graphs. David P. Bunde, Knox College
Erin W. Chambers, University of Illinois
Daniel Cranston, University of Illinois
Kevin Milans, University of Illinois
Douglas B. West*, University of Illinois
(1025-05-144)
4:00 p.m. Turan's theorem with colors. Ajit Diwan, Indian Institute of Technology, Bombay
Dhruv Mubayi*, University of Illinois at Chicago
(1025-05-76)
4:30 p.m. $k$-robust single message transmission. Andre Kundgen, Cal State San Marcos
Michael Pelsmajer, Illinois Institute of Technology
Radhika Ramamurthi*, Cal State San Marcos
(1025-05-211)
5:00 p.m. On the matching extendability of graphs in surfaces. Robert L Aldred, Department of Mathematics, Otago University, Dunedin, New Zealand
Ken-ichi Kawarabayashi, Institute of Informatics, Tokyo, Japan
Michael D Plummer*, Vanderbilt University, Nashville, Tennessee, USA
(1025-05-36)
8:30 a.m. Removing Even Crossings on Surfaces. Michael J. Pelsmajer*, Department of Applied Mathematics, Illinois Institute of Technology
Marcus Schaefer, Department of Computer Science, DePaul University
Daniel \v{S}tefankovi\v{c}, Computer Science Department, University of Rochester
(1025-05-45)
9:30 a.m. Representativity of Cayley maps. D. Christopher Stephens, Middle Tennessee State University
Thomas W Tucker, Colgate University
Xiaoya Zha*, Middle Tennessee State University
(1025-05-37)
3:00 p.m. Pan-partition Transitive Realizations. Arthur Busch, University of Dayton
Guantao Chen, Georgia State University
Michael Jacobson*, University of Colorado at Denver
Jian Shen, Texas State University - San Marcos
(1025-05-110)
5:00 p.m. The diameter game. J\'oszef Balogh, University of Illinois, Urbana-Champaign
Ryan Martin*, Iowa State University
Andr\'as Pluh\'ar, University of Szeged
(1025-05-11)