The 56th Midwestern Graph Theory Conference

Schedule

Friday

Registration
Registration will be in Kettler Hall (outside of KT 200, the main math office) on Friday afternoon, 3-6pm. Conference participants are welcome to attend "Mathematics: a Philatelic History", a talk given by Robin Wilson to our undergraduate math club starting at 3:30 in Kettler Hall 216. (The abstract is available on our math club's homepage
Banquet
As part of our celebrations, this instance of the conference will have a formal banquet on Friday evening. This will be held in the Walb Union International Ballroom A, with drinks at 6 and dinner at 7. Banquet tickets will cost $25 in advance, $30 if paying at the door.

Saturday schedule

(Or if you prefer, a printable version.)

TimeSB 168SB 185SB 178
8:00Registration -- SB 176
8:45Official welcome
9:00 Fundamental graphs for binary matroids, X. Zhou Hamiltonian edge-connectivity of 2-tree-generated networks, M. Abdallah
9:20 Strongly chordal k-trees, A. Busch Supereulerian digraphs, M. Algefari
9:40 Unichord-free graphs versus chordal graphs, T. McKee Cycle cover of strong tournaments, K. Alsatami
10:00 Vector space secret sharing scheme and efficient secret share computing, M. Atici The representation number of certain sparse graphs, R. Akhtar
10:20 Coffee break -- SB 176
10:40 Harary Lecture: A century of graph theory, R. Wilson
11:40 Conference photo and lunch break
1:10 P4-decompositions of regular graphs and multigraphs, M. Plantholt A Ramsey version of graph saturation, E. Yeager Modular Leech trees, C. D. Leach
1:30 Perfect matching covers of cubic graphs, J. Li A bichromatic view of matching, D. Johnston Hamilton cycles in 3-connected claw-free and net-free graphs, K. Wang
1:50 Spectral conditions of k-factors in regular graphs, X. Gu On proper path-colorings in graphs, E. Laforge The independent set sequence of trees, D. Galvin
2:10 Packing two graphs with bounded sums of edges with maximal degree, D. Yager The strong chromatic index of subcubic planar graphs, M. Santana Spanning trail with independence number, M. Zhang
2:30 Coffee break -- SB 176
2:50 The Lights Out game on subdivided caterpillars, D. Parker A generalization of the Lovász Local Lemma, A. Yu. Bernshteyn Vertex colorings induced by edge coloring and total coloring, R. Luo
3:10 Reversible peg solitaire on graphs, J. Engbers A note on the Laplacian spectral radius, M. Han On k-maximal digraphs, J. Anderson
3:30 Knight tours on triangular and hexagonal boards, A. Schwenk Eigenvalues and spanning tree packing of graphs, H.-J. Lai Lower bound of k-maximal digraph, M. Xu
3:50 Coffee break -- SB 176
4:15 Choosability of graph powers, B. Reiniger Unit vector flow with rank at most 2 and nowhere-zero 3-flows, J. Cheng
4:35 The mixing rate of non-backtracking random walks on graphs, M. Kempton On the ranks of (weighted) graphs, A. Yu
4:55 Surviving rate of planar digraphs, J. Kong