Speaker:  Jason Gao (Carleton University)
Time and Place: 20 October 2006, 10:00 am, HP4369, Herzberg building, Carleton University
Title: Some Interesting Properties of Circuit Graphs

Abstract: Circuit graphs are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs share many important properties with 3-connected planar graphs and they have nice recursive structures which are suitable for inductive argument. In this talk, we review some interesting results about circuit graphs such as existence of 2-walks, long cycles, and 2-connected spanning subgraphs with small degrees.