MIGHTY XXXVII

 

Friady, September 19:

6:30-7:00: Registration (Gellersen Hall)

7:00-8:00: Graph domination and forbidden induced subgraphs by Zsolt Tuza (Gellersen 131)

8:30-10:00: Welcome Reception with light refreshments at the Courtyard by Marriott

 

Saturday, September 20:

8:30-9:00: Registration, Refreshments (Gellersen Hall)

9:00-9:15 Welcome by President Harre (Urschell Hall 202)

9:15-10:15 Colorings of mixed hypergraphs by Zsolt Tuza (Urschell Hall 202)

The Contributed Paper Sessions are in Gellersen Hall

	Room 131	Room 130	Room 136
10:30-10:45	Edge coloring of simple graphs with small maximum degrees by Rong Luo	Fast necessary criteria for vertex-transitivity of graphs by Robert Jajcay	Graphs of Equivalent Lattice Paths by Rick Gillman
10:50-11:05	Max-Coloring interval graphs by Rajiv Raman	Functions of the degree sequence that give lower bounds on independence number by Patricia Nelson	Some Polyomino Packing Games by Jerry Kabell
11:10-11:25	Equitable ?-coloring of graphs with low average degree by Kittikorn Nakprasit	Regular Clique Covers of Graphs by Dalibor Froncek	The n-Queens Problem With Diagonal Constraints by W. Doug Weakley
BREAK
11:50-12:05	You've got Erdos-Ko-Rado: Intersecting hypergraphs online by Ryan Martin	When a cartesian product is a triangle graph by Weiting Cao	Minimal Separators versus Maximal Bicliques by Terry McKee
12:10-12:25	Vertex magic total labeling of Cartesian products of some regular VMT regular graphs and even cycles by Petr Kovár	Homogeneously Embedding Stratified Graphs in Stratified Graphs by Ping Zhang	Chords of the longest circuits in locally planar graphs by Jianbing Niu
12:30-12:45	Isometric decompositions of complete graphs by Roger Eggleton	Circular flows of graphs by Rui Xu	A new construction for the n-cube partitioning by Sergei Bezrukov
LUNCH

2:00-2:15	List-Coloring Certain Complete Multipartite Graphs by Linda Eroh	On Recovering a Multipartite Tournament from its Lattice of Convex subsets by Darren Parker	Multidesigns of the ?-fold complete graph by Atif Abueida
2:20-2:35	Piercing numbers and coloring disjointness graphs of translates of a convex set by Seog-Jin Kim	Reconstruction under group action by Jamie Radcliffe	Generating triples by Todd Will
2:40-2:55	Diameters of isomorphic spanning trees factorizing complete graphs by Tereza Kovárová	An extension of a Dirac-type bound for k-ordered hamiltonian graphs by Gexin Yu	The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 by Michael J. Pelsmajer
3:00-3:15	Covering n-space and Coloring metric spaces by Jeong-Hyun Kang	On Rainbow Arithmetic Progressions by Maria Axenovich	An Upper Bound of Integrity of n-cage Graph by Mustafa Atici
3:20-3:35	How often does Chvátal's Condition hold? by Douglas B. West	Orienting Graphs to Optimize Acyclic Reachability by Suk Jai Seo	Hamiltonian Connectedness in 3-connected Line Graphs by Yehong Shao
REFRESHMENTS