## Seminars and Colloquia by Series

### TBA by Bernard Lidický

Series
Graph Theory Seminar
Time
Tuesday, April 27, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
Bernard LidickýIowa State University

TBA

### TBA by David Wood

Series
Graph Theory Seminar
Time
Tuesday, April 20, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
David WoodMonash University

TBA

### TBA by Songling Shan

Series
Graph Theory Seminar
Time
Tuesday, April 13, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
Songling ShanIllinois State University

TBA

### TBA by Lina Li

Series
Graph Theory Seminar
Time
Tuesday, April 6, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
Lina LiUniversity of Waterloo

TBA

### TBA by James Anderson

Series
Graph Theory Seminar
Time
Tuesday, March 30, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
James AndersonGeorgia Institute of Technology

TBA

### TBA by Caroline Terry

Series
Graph Theory Seminar
Time
Tuesday, March 23, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
Caroline TerryOhio State University

TBA

### TBA by Richard Lang

Series
Graph Theory Seminar
Time
Tuesday, March 9, 2021 - 12:30 for 1 hour (actually 50 minutes)
Location
Speaker
Richard LangHeidelberg University

Please Note: Note the unusual time!

TBA

### TBA by Maria Axenovich

Series
Graph Theory Seminar
Time
Tuesday, March 2, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
Maria AxenovichKarlsruhe Institute of Technology

TBA

### Constructing minimally 3-connected graphs

Series
Graph Theory Seminar
Time
Tuesday, February 23, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
Speaker
Sandra KinganBrooklyn College, CUNY

A 3-connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the results in (Dawes, JCTB 40, 159-168, 1986) using two operations: adding an edge between non-adjacent vertices and splitting a vertex of degree at least 4. To test sets of vertices and edges for 3-compatibility, which depends on the cycles of the graph, we develop a method for obtaining the cycles of $G'$ from the cycles of $G$, where $G'$ is obtained from $G$ by one of the two operations above.  We eliminate isomorphic duplicates using certificates generated by McKay's isomorphism checker nauty. The algorithm consecutively constructs the non-isomorphic minimally 3-connected graphs with $n$ vertices and $m$ edges from the non-isomorphic minimally 3-connected graphs with $n-1$ vertices and $m-2$ edges, $n-1$ vertices and $m-3$ edges, and $n-2$ vertices and $m-3$ edges. In this talk I will focus primarily on the theorems behind the algorithm. This is joint work with Joao Costalonga and Robert Kingan.

### Fractional chromatic number of graphs of bounded maximum degree

Series
Graph Theory Seminar
Time
Tuesday, February 16, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location