Solvable regular coverings of graphs
Presented by Rok POZAR
Type: Oral presentation
Track: Symmetries in Graphs, Maps and Other Discrete Structures
Covering techniques have received considerable attention over the years, with its main incentive in constructing regular coverings of graphs with specific symmetry properties. Accordingly, one would like to find algorithms that would deliver answers to certain natural questions regarding symmetry issues of graphs and their coverings; this adds further motivation to the topic. In the talk we will discuss certain algorithmic aspects related to solvable regular coverings.