Graph-theoretic tasks in Bebras competition

V diplomski nalogi smo analizirali naloge z računalniškega tekmovanja Bober, ki se nanašajo na grafe. V prvem delu naloge smo opisali algoritme iz teorije grafov, ki jih pogosto uporabljamo v računalništvu. Nato smo pregledali naloge s tekmovanja Bober in izbrali tiste, ki so povezane s teorijo grafov. Izbrane naloge smo razvrstili v skupine na tri različne načine: najprej glede na uporabljen algoritem iz teorije grafov, nato glede na abstraktnost grafa, ki se v nalogi pojavi, na koncu pa še glede na abstraktnost same naloge.In thesis we analyzed graph-theoretic tasks in Bebras competition. First we described graph-theoretic algorithms, which are commonly used in computer science. Then we chose tasks from Bebras competition challenges which refer to graph theory and classified selected tasks in groups in three different ways: first depending on used algorithm from graph theory, then according to the abstractness of graph that appears in the task, and in the end also according to abstractness of the entire task