SMS scnews item created by Andrew Mathas at Tue 28 May 2013 1306
Expiry: 7 Jun 2013
Calendar1: 7 Jun 2013 1400-1500
CalLoc1: AGR Carslaw 829
CalTitle1: AGR Seminar: Four-valent graphs with a cross structure: Euler tours, chord diagrams, embeddings in surfaces
Auth: email@example.com (assumed)
Four-valent graphs with a cross structure: Euler tours, chord diagrams, embeddings in surfaces
Professor Denis Ilyutko (Moscow University, Russia)
La Trobe University
We consider finite connected four-valent graphs with a cross structure, i.e. graphs with a pairing of the four half-edges at each vertex. Graphs with a cross structure have Euler tours of different types depending on travelling through a vertex: we can pass from a half-edge to the opposite half-edge and we can pass from a half-edge to a non-opposite half-edge. In turn Euler tours are encoded by chord diagrams. There are criterion in terms of chord diagrams telling us when a graph with a cross structure can be embedded in the plane (Cairns-Elton and Read-Rosenstiehl) and surfaces with a genus g (Manturov). These criterion use different approaches depending on types of Euler tours in question. In the first part of the talk we consider a connection between these criterion. The second part of the talk is devoted to simple graphs and chord diagrams. It is known that there are graphs which are not circle graphs (not intersection graphs of chord diagrams) (Bouchet). But in spite of this fact many properties which circle graphs have remain true for simple graphs.
Dr Yury Nikolayevsky
If you would like to attend this seminar in our access grid room then please check to see if the grid is already booked at this time and send an email to firstname.lastname@example.org to let the CSOs know that you would like to attend.