Harary Lecturer

Marc Lipman

Title: "Failures"

The MIGHTY Conferences were created to foster the development
of graph theory research through building a community of scholars
and the presentation of work in progress. We gathered to talk about
work in progress as well as finished results. The mission of the
MIGHTY Conferences has expanded somewhat, just as has the
meaning of the acronym. Harkening back to the old days,
this talk reports on some unaccomplished graph theory projects.

Submitted Talks (Click on Author's Name for Abstract)

We will continue to update this page as more abstracts come in.

Scott Anderson,
          Using Matrix Multiplication to Store Path Information
Jay Bagga, with Adrian Heinz
          An Algorithm for Graceful Labelings of Paths
Michael Barrus,
          Pseudo-split Graphs, a Decomposition Method, and the Chair Graph
Art Busch,
          Arc-Traceable Local Tournaments
Rama Chidambaram,
          A Necessary and Sufficient Condition for a Tree to Be Graceful
Garry L. Johns, with Gary Chartrand, Kathleen A. McKeon, Futaba Okomoto, and Ping Zhang
          Recent Results on Rainbow Connectivities in Graphs
Aaron Kershenbaum, with George Leeman, Keitha Murray, Teresa Piliouras, and Robert Schiaffino
          Graph Isomorphism in Expected Linear Time and Space
Mohit Kumbhat, with A. Kostochka,
          Coloring Uniform Simple Hypergraphs with Few Edges
Hong-Jian Lai, with Rui Xu and Cun-Quan Zhang,
          On Circular Flows of Graphs
Terry McKee,
          Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs
Yehong Shao,
          On s-Pancyclic Line Graphs
Nart Shawash,
          Connectivity Properties of Oriented Cayley Graphs Generated by Transpositions
R. Sritharan,
          Structure of 4-Leaf Powers
Ida Svejdarova,
          Product Dimension of Trees
Matt Walsh,
          Hamiltonicity and Restricted Block-Intersection Graphs of t-Designs
Henning Wunderlich,
          Covers Have Structure