The 56th Midwestern Graph Theory Conference

Participants

The members of the organizing committee welcome participation from interested members of the mathematical community throughout and beyond the midwest. No registration fee is required, but we do request that you register to let us know that you're planning to attend.

NameAffiliationTalk title
Mohamad AbdallahOakland UniversityHamiltonian edge-connectivity of 2-tree generated networks
Reza AkhtarMiami UniversityThe representation number of certain sparse graphs
Mansour AlgefariWest Virginia UniversitySupereulerian digraphs
Khalid AlsatamiWest Virginia UniversityCycle cover of strong tournaments
Janet AndersonWest Virginia UniversityOn k-maximal digraphs
Mustafa AticiWestern Kentucky UniversityVector Space Secret Sharing Scheme and Efficient Secret Share Computing
Jay BaggaBall State University
Jennifer BeinekeWestern New England University
Lowell BeinekeIPFW
Anton BernshteynUniversity of Illinois at Urbana-ChampaignA generalization of the Lovász Local Lemma
Allan BickleCalvin College
Arthur BuschUniversity of DaytonStrongly chordal k-trees
Zhihong ChenButler University
Jian ChengWest Virginia UniversityUnit vector flow with rank at most 2 and nowhere-zero 3-flows
Janet DalzellIvy Tech Community College
Ann DarkeBowling Green State University
Peter DragnevIPFW
John EngbersMarquette UniversityReversible peg solitaire on graphs
David GalvinUniversity of Notre DameThe independence set sequence of trees
Xiaofeng GuUniversity of Wisconsin-SuperiorSpectral conditions of k-factors in regular graphs
Peter HamburgerWestern Kentucky University
Miaomiao HanWest Virginia UniversityA note on the Laplacian spectral radius
Laars HeleniusWestern Michigan University
Daniel JohnstonWestern Michigan UniversityA bichromatic view of matchings
Mark KemptonUniversity of California-San DiegoThe mixing rate of non-backtracking random walks on graphs
Lazaros KikasUniversity of Detroit-Mercy
KisslerIvy Tech Community College
Jiangxu KongXiamen UniversitySurviving rate of planar digraphs
Elliot LaforgeWestern Michigan UniversityOn proper-path colorings of graphs
Hong-Jian LaiWest Virginia UniversityEigenvalues and spanning packing trees of graphs
David LeachUniversity of West GeorgiaModular Leech trees
Linda LesniakDrew University
Jiaao LiWest Virginia UniversityPerfect matching covers of graphs
Marc LipmanIPFW
Jianping LiuFuzhou University
Sarah LoebUniversity of Illinois at Urbana-Champaign
You LuWest Virginia University
Rong LuoWest Virginia UniversityVertex colorings induced by edge colorings and total colorings
Terry McKeeWright State UniversityUnichord-free graphs vs. chordal graphs
Darren ParkerGrand Valley State UniversityThe Lights Out game on subdivided caterpillars
Ray PippertIPFW
Mike PlantholtIllinois State UniversityP4-decomposition of regular graphs and multigraphs
Ben ReinigerUniversity of Illinois at Urbana-ChampaignChoosability of graph powers
Michael SantanaUniversity of Illinois at Urbana-ChampaignThe strong chromatic index of subcubic planar graphs
Allen SchwenkWestern Michigan UniversityKnight tours on triangular and hexagonal boards
Chip VandellIPFW
Badri VarmaUniversity of Wisconsin-Fox Valley
Matt WalshIPFW
Keke WangWest Virginia UniversityHamiltonian net-free and claw-free graphs
Doug WeakleyIPFW
Robin WilsonOpen UniversityA century of graph theory
Murong XuWest Virginia UniversityLower bound of the size of k-maximal graphs
Derrek YagerUniversity of Illinois at Urbana-ChampaignPacking two graphs with bounded sum of edges and maximum degree
Senmei YaoMarian University
Elyse YeagerUniversity of Illinois at Urbana-ChampaignA Ramsey version of graph saturation
Aimei YuBeijing Jiaotong UniversityOn the rank of (weighted) graphs
Meng ZhangWest Virginia UniversitySpanning trail with independence number
Xiangqian (Joe) ZhouWright State UniversityFundamental graphs for binary matroids