Monday, June 12

Cycles in Graphs

3:30 pm - 6:00 pm
Room: Section B
Chair: Garth Isaak, Lehigh University, USA

3:30 - 3:45 Acyclic Orientations that Survive One Reversal
Karen L. Collins and Kimberly Tysdal, Wesleyan University, USA
3:50 - 4:05 How Hamiltonian is a Graph?
Garth Isaak, Lehigh University, USA
4:10 - 4:25 On a Spanning Tree Algorithm
Michael Bridgland, Center for Computing Sciences, USA; and Edward R. Scheinerman, The Johns Hopkins University, USA
4:30 - 4:45 The Number of Unit Distances
Nathaniel Dean, Rice University, USA
4:50 - 5:05 Cycles in Sparse Graphs
J. B. A. Verstraéte, University of Cambridge, United Kingdom
5:10 - 5:25 A Characterization of d-triangles
Fatima Affif Chaouche and Abdelhafid Berrachedi, Université d'Alger, Alger

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 5/4/00