Speaker
Dr
Rok Pozar
(University of Primorska)
Description
Combinatorial treatment of graph coverings in terms of voltages has 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 discuss certain computational problems related to
covering graph techniques.
Primary author
Dr
Rok Pozar
(University of Primorska)
