Tomaž Pisanski: Regular nut graphs and the Fowler extension

Povzetek. We determine all values of n such that a nut cubic graph of order n exists. We also consider the same question for regular graphs of valence d > 3. The main tool in our approach is the Fowler extension of a graph. If time permits we will also give a demonstration of a short sagemath program that tests whether a given graph is a nut graph.

This talk is based on the work in progress with John Baptist Gauci and Irene Sciriha.