(SI) Predlagani projekt je osredotočen na strukturno in algoritmično teorijo grafov, s poudarkom na izboru nekaterih klasičnih in sodobnih obetavnih raziskovalnih smeri na preseku teorije grafov in teoretičnega računalništva: problem neodvisne množice v hereditarnih grafovskih razredih; študij cene povezanosti za probleme neodvisnosti in dominacije; študij grafovskih razredov, definiranih preko klik in neodvisnih množic, vključno s CIS grafi in ekvistabilnimi grafi; študij grafovskih razredov, definiranih preko problemov dominacije; računska zahtevnost in algoritmi za probleme dominacije. Poleg naštetih področij bo projekt vključeval tudi raziskovalno delo na drugih vejah teorije grafov, vključno z algebraično teorijo grafov.
(EN) This project proposal is focused on structural and algorithmic aspects of Graph Theory and concentrates on a selection of classical and modern promising research areas at the intersection of Graph Theory with Theoretical Computer Science: the independent set problem in hereditary graph classes; the study of the price of connectivity for variants of independence and domination; the study of graph classes defined by cliques and independent sets, including CIS graphs and equistable graphs; the study of graph classes defined by variants of domination; computational complexity and algorithms for variants of domination. In addition to the above-described topics, the project also includes research in other related areas of graph theory, including Algebraic Graph Theory.