The following is the conference schedule. You can view  all abstracts here. Alternatively, here is the complete conference program.



8:00-8:30

Registration

8:30-8:45

Welcoming Remarks:

Dr. Greg Dunaway, Dean, Eberly College of Arts and Sciences

Room: Armstrong Hall 209

8:45-9:45

Neil Robertson

 

Some interesting problems in combinatorial theory and graph theory

ARM Room 209

9:45-10:00

Coffee Break

 

Room 403

Room 407

Room 415

10:00-10:25

Christopher Cox

 

Inverting the Turán problem

 

Junfeng Du

 

The locally structure of claw-free graphs without induced generalized bull

Zhongyuan Che

 

Forcing and anti-forcing edges in bipartite graphs

10:30-10:55

Lauren Keough

 

Maximizing the Number of Independent Sets in Hypergraphs

Linda Lesniak

 

Sufficient edge conditions for hamiltonicity in k-partite graphs

Ju Zhou

 

Perfect Matching Transitivity of Graphs

11:00-11:25

Yingzhi Tian

 

On the sizes of k-edge-maximal r-uniform hypergraphs

Mingquan Zhan

 

s-hamiltonian Connected Line Graphs

Michael Wigal

 

Efficiency of First Fit Chain Partitioning Finite Posets

11:30-11:55

Arran Hamm

 

Biplanar Crossing Number and the Probabilistic Method

Taoye Zhang

 

s-Hamiltonian line graphs of claw-free graphs

Daniel Cranston

 

Bootstrap Percolation Thresholds in Plane Tilings using Regular Polygons

 

 

12:00-13:30

Lunch

 

Saturday Afternoon, April 28, 2018

13:30-14:30

Jacques Verstraete

 

On Kalai's Tight Tree Conjecture

ARM Room 209

 

14:30-14:55

Chanun Lewchalermvongs

 

Graphs with no { W4 , K5 \e }-induced minor

Allan Bickle

 

Collapsible Graphs

Ryan Hansen

 

Polychromatic colorings of complete graphs with respect to 1-regular and 2-regular subgraphs

 

15:00-15:25

Sandra Kingan

 

Minor preserving deletable edges in graphs

Yang Wu

 

Supereulerian width of dense graphs

Joseph Sampson

 

Polychromatic number of sets of size 3

 

15:30-15:45

Coffee Break

 

15:45-16:10

Murong Xu

 

On r-hued coloring of graphs without short induced paths

Huiya Yan

 

Line graphs containing 2-factors with bounded number of components

Sarah Loeb

 

Colored Saturation for Complete Graphs

 

16:15-16:40

Katie Horacek

 

List star chromatic index of sparse graphs

Keke Wang

 

Degree Sum and Hamiltonian-Connected Line Graphs

Robert W Robinson

 

Efficient enumeration of unlabeled bipartite blocks

 

 

16:45-17:10

Xiangwen Li

 

Planar graphs without adjacent cycles of length at most five are (2, 0, 0) -colorable

Joseph Briggs

 

Coloring Hamilton Cycles Online

 

 

17:15-17:40

H.W. Gould

 

Some trees in my forest

Yehong Shao

 

s-vertex pancyclic graphs and Maximum Degree

 

 

18:30

Dinner:  No. 1 Super Buffet: 1086 Suncrest Towne Centre Drive, Morgantown, WV 26505