MIGHTY LX

Schedules

Copies of the conference program and collected abstracts are available for download. Individual abstracts will be linked to the schedule on the website soon.

Friday, September 28

Time	Event	Location
4:00-5:30pm	Conference registration	Faculty Lounge (Kettler Hall 154)
5:30-6:30pm	Cocktail hour	Alumni Centre
6:30-9:30pm	Conference banquet	Alumni Centre

Saturday, September 29

The conference activities on Saturday all take place in the Science Building (SB). Morning registration will begin at 8:00am in SB 176, which will also serve as the break room throughout the day. The official welcome will be at 8:45am in SB 168.

Time	SB 168	SB 185
9:00-9:20	Akito Oshima	A Somasundaram
9:20-9:40	Murong Xu	Dalibor Froncek
9:40-10:00	Sylwia Cichacz	Terry McKee
10:00-10:20	Linda Lesniak	Xiaofeng Gu
10:20-10:40	Coffee break
10:40-11:40	Harary Lecture — S Arumugam (SB 168)
11:40-11:50	Conference photo (SB 168)
11:50-1:10	Lunch break
1:10-1:30	Slamin	Michael Santana
1:30-1:50	Andrea Feňovčíková	Lauren Keough
1:50-2:10	Mark Korenblit	Allan Bickle
2:10-2:30	Coffee break
2:30-2:50	Jian-Bing Liu	Rinovia Simanjuntak
2:50-3:10	Zhang Zhang	Garry Johns
3:10-3:30	Dara Nicole Zirlin	Yang Wu
3:30-3:50	Break
3:50-4:10	Yu Qiu	Shariefuddin Pirzada
4:10-4:30	Jeremy Lyle	Grace McCourt
4:30-4:50	Ranjan Rohgati	Jennifer White

List of contributed talks

• Independence Number of Maximal Planar Graphs, Allan Bickle (Pennsylvania State University -- Altoona)
• Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs, Sylwia Cichacz (AGH University of Science and Technology, Poland)
• Inclusive distance vertex irregular labelings, Andrea Feňovčíková (Technical University of Kosice, Slovakia)
• Nearly Platonic graphs, Dalibor Froncek (University of Minnesota-Duluth)
• Chorded cycles in dense graphs, Xiaofeng Gu (University of West Georgia)
• On the Connectedness of 3-Line Graphs, Gary Johns (Saginaw Valley State University)
• The Maximum Rectilinear Crossing Number of Some Spiders, Lauren Keough (Grand Valley State University)
• Structures and numbers of minicuts in two-terminal directed acyclic graphs, Mark Korenblit (Holon University of Technology, Israel)
• Hamiltonian Properties in k-Partite Graphs, Linda Lesniak (Western Michigan University)
• Matching Number and Modulo Orientations, Jianbing Liu (West Virginia University)
• The Super Slater Number of a Graph, Jeremy Lyle (Olivet College)
• A bounded diameter strengthening of Ryser's conjecture, Grace McCourt
• Odd twists on strongly chordal graphs, Terry McKee (Wright State University)
• The Strength of Hypercubes, Akito Oshima (University of Newcastle, Australia)
• Laplacian spectra of a graph and Brouwer's conjecture, Shariefuddin Pirzada (University of Kashmir, India)
• Some sharp results on the generalized Turán numbers, Yu Qiu (University of Science and Technology of China)
• Lozenge tilings of a symmetric hexagon with a missing shamrock, Ranjan Rohatgi (Saint Mary's College)
• Finding disjoint theta graphs with a given minimum degree, Michael Santana (Grand Valley State University)
• On the local metric dimension of line graphs, Rinovia Simanjuntak (Institut Teknologi Bandung, Indonesia)
• Distance vertex irregular labeling of graphs, Slamin (University of Jember, Indonesia)
• Domination Subdivision Number of a Graph , A. Somasundaram (Birla Institute of Technology & Science, Pilani, India)
• Additive List Coloring of Planar Graphs with Given Girth, Jennifer White (Saint Vincent College)
• On s-Hamiltonian Z₈-free line graphs, Yang Wu (West Virginia University)
• Decomposition and r-hued Coloring of K₄(h)-minor Free Graphs, Murong Xu (Ohio State University)
• Flows of signed graphs and related topics, Zhang Zhang (West Virginia University)
• Cut-edges and regular factors in regular graphs of odd degree, Dara Zirlin (University of Illinois Urbana-Champaign)