Cover-incomparability graphs and chordal graphs. - Bostjan Bresar; Manoj Changat; Tanja Gologranc; Joseph Mathews; Antony Mathews (Discret. Appl. Math., 2010)

On a local 3-Steiner convexity. - Bostjan Bresar; Tanja Gologranc (Eur. J. Comb., 2011)

Dominating sequences in graphs. - Bostjan Bresar; Tanja Gologranc; Martin Milanic; Douglas F. Rall; Romeo Rizzi (Discret. Math., 2014)

Tree-like partial Hamming graphs. - Tanja Gologranc (Discuss. Math. Graph Theory, 2014)

Rainbow Connection and Graph Products. - Tanja Gologranc; Gasper Mekis; Iztok Peterin (Graphs Comb., 2014)

Toll convexity. - Liliana Alcón; Bostjan Bresar; Tanja Gologranc; Marisa Gutierrez; Tadeja Kraner Sumenjak; Iztok Peterin; Aleksandra Tepeh (Eur. J. Comb., 2015)

Cographs Which are Cover-Incomparability Graphs of Posets. - Bostjan Bresar; Tanja Gologranc; Manoj Changat; Baiju Sukumaran (Order, 2015)

Dominating Sequences in Grid-Like and Toroidal Graphs. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Balázs Patkós; Zsolt Tuza; Máté Vizer (Electron. J. Comb., 2016)

A characterization of plane Gauss paragraphs. - Dan Archdeacon; Drago Bokal; Tanja Gologranc (Ars Math. Contemp., 2017)

Grundy dominating sequences and zero forcing sets. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Optim., 2017)

Toll number of the Cartesian and the lexicographic product of graphs. - Tanja Gologranc; Polona Repolusk (Discret. Math., 2017)

Convex and isometric domination of (weak) dominating pair graphs. - Bostjan Bresar; Tanja Gologranc; Tim Kos (Theor. Comput. Sci., 2018)

Toll number of the strong product of graphs. - Tanja Gologranc; Polona Repolusk (Discret. Math., 2019)

Graphs with unique zero forcing sets and Grundy dominating sets. - Bostjan Bresar; Tanja Dravec (CoRR, 2021)

On Grundy total domination number in product graphs. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Tilen Marc; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discuss. Math. Graph Theory, 2021)

Ptolemaic and Planar Cover-incomparability Graphs. - Arun Anil; Manoj Changat; Tanja Gologranc; Baiju Sukumaran (Order, 2021)

Graphs with a unique maximum independent set up to automorphisms. - Bostjan Bresar; Tanja Dravec; Aleksandra Gorzkowska; Elzbieta Kleszcz (Discret. Appl. Math., 2022)

On the toll number of a graph. - Tanja Dravec (Discret. Appl. Math., 2022)

Daisy Hamming graphs. - Tanja Dravec; Andrej Taranenko (Discuss. Math. Graph Theory, 2023)

On the chromatic edge stability index of graphs. - Saieed Akbari; Arash Beikmohammadi; Bostjan Bresar; Tanja Dravec; Mohammad Mahdi Habibollahi; Nazanin Movarraei (Eur. J. Comb., 2023)

Uniquely colorable graphs up to automorphisms. - Bostjan Bresar; Tanja Dravec; Elzbieta Kleszcz (Appl. Math. Comput., 2023)

Spreading in graphs. - Bostjan Bresar; Tanja Dravec; Aysel Erey; Jaka Hedzet (Discret. Appl. Math., 2024)

Graphs with span 1 and shortest optimal walks. - Tanja Dravec; Mirjana Mikalacki; Andrej Taranenko (Appl. Math. Comput., 2025)

k-Domination ivariants on Kneser graphs. - Bostjan Bresar; Tanja Dravec; María Gracia Cornet; Michael A. Henning (Ars Math. Contemp., 2025)

Maker-Breaker domination game critical graphs. - Athira Divakaran; Tanja Dravec; Tijo James; Sandi Klavzar; Latha S. Nair (Discret. Appl. Math., 2025)

Induced matching vs edge open packing: Trees and product graphs. - Bostjan Bresar; Tanja Dravec; Jaka Hedzet; Babak Samadi (Discret. Math., 2025)