On clique-gated graphs. - Bostjan Bresar (Discret. Math., 1999)

On subgraphs of Cartesian product graphs and S-primeness. - Bostjan Bresar (Electron. Notes Discret. Math., 2000)

Partial Hamming graphs and expansion procedures. - Bostjan Bresar (Discret. Math., 2001)

On Vizing's conjecture. - Bostjan Bresar (Discuss. Math. Graph Theory, 2001)

Cubes polynomial and its derivatives. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Electron. Notes Discret. Math., 2001)

The direct expansion of graphs. - Bostjan Bresar (Discret. Math., 2002)

On the Natural Imprint Function of a Graph. - Bostjan Bresar (Eur. J. Comb., 2002)

Tiled partial cubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar; Henry Martyn Mulder; Riste Skrekovski (J. Graph Theory, 2002)

The Cube Polynomial and its Derivatives: the Case of Median Graphs. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Electron. J. Comb., 2003)

Fast recognition algorithms for classes of partial cubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discret. Appl. Math., 2003)

On the independence graph of a graph. - Bostjan Bresar; Blaz Zmazek (Discret. Math., 2003)

Arboreal structure and regular graphs of median-like classes. - Bostjan Bresar (Discuss. Math. Graph Theory, 2003)

Tree-like isometric subgraphs of hypercubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discuss. Math. Graph Theory, 2003)

Intersection graphs of maximal hypercubes. - Bostjan Bresar (Eur. J. Comb., 2003)

Quasi-median graphs, their generalizations, and tree-like equalities. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Eur. J. Comb., 2003)

Square-free colorings of graphs. - Bostjan Bresar; Sandi Klavzar (Ars Comb., 2004)

Cubic inflation, mirror graphs, regular maps, and partial cubes. - Bostjan Bresar; Sandi Klavzar; Alenka Lipovec; Bojan Mohar (Eur. J. Comb., 2004)

Vizing-like Conjecture for the Upper Domination of Cartesian Products of Graphs - The Proof. - Bostjan Bresar (Electron. J. Comb., 2005)

Reconstructing subgraph-counting graph polynomials of increasing families of graphs. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discret. Math., 2005)

Median and quasi-median direct products of graphs. - Bostjan Bresar; Pranava K. Jha; Sandi Klavzar; Blaz Zmazek (Discuss. Math. Graph Theory, 2005)

Paired-domination of Cartesian products of graphs and rainbow domination. - Bostjan Bresar; Michael A. Henning; Douglas F. Rall (Electron. Notes Discret. Math., 2005)

Hypercubes As Direct Products. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar; Blaz Zmazek (SIAM J. Discret. Math., 2005)

Theta-graceful labelings of partial cubes. - Bostjan Bresar; Sandi Klavzar (Discret. Math., 2006)

Roots of cube polynomials of median graphs. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (J. Graph Theory, 2006)

On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2007)

On the 2-rainbow domination in graphs. - Bostjan Bresar; Tadeja Kraner Sumenjak (Discret. Appl. Math., 2007)

Nonrepetitive colorings of trees. - Bostjan Bresar; Jaroslaw Grytczuk; Sandi Klavzar; Staszek Niwczyk; Iztok Peterin (Discret. Math., 2007)

Maximal proper subgraphs of median graphs. - Bostjan Bresar; Sandi Klavzar (Discret. Math., 2007)

Dominating direct products of graphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2007)

On cube-free median graphs. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Discret. Math., 2007)

Edge-connectivity of strong products of graphs. - Bostjan Bresar; Simon Spacapan (Discuss. Math. Graph Theory, 2007)

Characterizing almost-median graphs. - Bostjan Bresar (Eur. J. Comb., 2007)

Hamming polynomials and their partial derivatives. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Michel Mollard (Eur. J. Comb., 2007)

Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs. - Bostjan Bresar; Sandi Klavzar (SIAM J. Discret. Math., 2007)

On the connectivity of the direct product of graphs. - Bostjan Bresar; Simon Spacapan (Australas. J Comb., 2008)

Game Chromatic Number of Cartesian Product Graphs. - Tomasz Bartnicki; Bostjan Bresar; Jaroslaw Grytczuk; Matjaz Kovse; Zofia Miechowicz; Iztok Peterin (Electron. J. Comb., 2008)

Crossing graphs of fiber-complemented graphs. - Bostjan Bresar; Aleksandra Tepeh Horvat (Discret. Math., 2008)

On the geodetic number of median graphs. - Bostjan Bresar; Aleksandra Tepeh Horvat (Discret. Math., 2008)

On the geodetic number and related metric sets in Cartesian product graphs. - Bostjan Bresar; Sandi Klavzar; Aleksandra Tepeh Horvat (Discret. Math., 2008)

On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. - Douglas F. Rall; Bostjan Bresar; Art S. Finbow; Sandi Klavzar (Electron. Notes Discret. Math., 2008)

Cover-Incomparability Graphs of Posets. - Bostjan Bresar; Manoj Changat; Sandi Klavzar; Matjaz Kovse; Joseph Mathews; Antony Mathews (Order, 2008)

Broadcast domination of products of graphs. - Bostjan Bresar; Simon Spacapan (Ars Comb., 2009)

θ-graphs of partial cubes and strong edge colorings. - Bostjan Bresar; Tadeja Kraner Sumenjak (Ars Comb., 2009)

Characterizing posets for which their natural transit functions coincide. - Bostjan Bresar; Manoj Changat; Sandi Klavzar; Joseph Mathews; Antony Mathews; Prasanth G. Narasimha-Shenoi (Ars Math. Contemp., 2009)

On the remoteness function in median graphs. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Wilfried Imrich; Sandi Klavzar; Matjaz Kovse; Ajitha R. Subhamathi (Discret. Appl. Math., 2009)

Steiner intervals, geodesic intervals, and betweenness. - Bostjan Bresar; Manoj Changat; Joseph Mathews; Iztok Peterin; Prasanth G. Narasimha-Shenoi; Aleksandra Tepeh Horvat (Discret. Math., 2009)

Cube intersection concepts in median graphs. - Bostjan Bresar; Tadeja Kraner Sumenjak (Discret. Math., 2009)

Cage-amalgamation graphs, a common generalization of chordal and median graphs. - Bostjan Bresar; Aleksandra Tepeh Horvat (Eur. J. Comb., 2009)

Fair reception and Vizing's conjecture. - Bostjan Bresar; Douglas F. Rall (J. Graph Theory, 2009)

Computing median and antimedian sets in median graphs. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Sandi Klavzar; Matjaz Kovse; Ajitha R. Subhamathi (Algorithmica, 2010)

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

The periphery graph of a median graph. - Bostjan Bresar; Manoj Changat; Ajitha R. Subhamathi; Aleksandra Tepeh Horvat (Discuss. Math. Graph Theory, 2010)

Simultaneous embeddings of graphs as median and antimedian subgraphs. - Kannan Balakrishnan; Bostjan Bresar; Matjaz Kovse; Manoj Changat; Ajitha R. Subhamathi; Sandi Klavzar (Networks, 2010)

Domination Game and an Imagination Strategy. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (SIAM J. Discret. Math., 2010)

Geodetic Sets in Graphs. - Bostjan Bresar; Matjaz Kovse; Aleksandra Tepeh (Structural Analysis of Complex Networks, 2011)

Minimum k-path vertex cover. - Bostjan Bresar; Frantisek Kardos; Ján Katrenic; Gabriel Semanisin (Discret. Appl. Math., 2011)

The geodetic number of the lexicographic product of graphs. - Bostjan Bresar; Tadeja Kraner Sumenjak; Aleksandra Tepeh Horvat (Discret. Math., 2011)

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

A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks. - Drago Bokal; Bostjan Bresar; Janja Jerebic (Discret. Appl. Math., 2012)

Vizing's conjecture: a survey and recent results. - Bostjan Bresar; Paul Dorbec; Wayne Goddard; Bert L. Hartnell; Michael A. Henning; Sandi Klavzar; Douglas F. Rall (J. Graph Theory, 2012)

On the vertex kk-path cover. - Bostjan Bresar; Marko Jakovac; Ján Katrenic; Gabriel Semanisin; Andrej Taranenko (Discret. Appl. Math., 2013)

Domination game: Extremal families of graphs for 3/53/5-conjectures. - Bostjan Bresar; Sandi Klavzar; Gasper Kosmrlj; Douglas F. Rall (Discret. Appl. Math., 2013)

Domination game played on trees and spanning subgraphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2013)

Retracts of Products of Chordal Graphs. - Bostjan Bresar; Jérémie Chalopin; Victor Chepoi; Matjaz Kovse; Arnaud Labourel; Yann Vaxès (J. Graph Theory, 2013)

The hypergraph of θ-classes and θ-graphs of partial cubes. - Bostjan Bresar; Tadeja Kraner Sumenjak (Ars Comb., 2014)

On the weighted k-path vertex cover problem. - Bostjan Bresar; Rastislav Krivos-Bellus; Gabriel Semanisin; Priomoz Sparl (Discret. Appl. Math., 2014)

Equal opportunity networks, distance-balanced graphs, and Wiener game. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Sandi Klavzar; Aleksander Vesel; Petra Zigert Pletersek (Discret. Optim., 2014)

Domination game: Effect of edge- and vertex-removal. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Gasper Kosmrlj (Discret. Math., 2014)

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

Vizing's Conjecture for Graphs with Domination Number 3 - a New Proof. - Bostjan Bresar (Electron. J. Comb., 2015)

Guarded subgraphs and the domination game. - Bostjan Bresar; Sandi Klavzar; Gasper Kosmrlj; Douglas F. Rall (Discret. Math. Theor. Comput. Sci., 2015)

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

On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway. - Bostjan Bresar; Douglas F. Rall (Graphs 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)

Total dominating sequences in graphs. - Bostjan Bresar; Michael A. Henning; Douglas F. Rall (Discret. Math., 2016)

1-perfectly orientable K4-minor-free and outerplanar graphs. - Bostjan Bresar; Tim Kos; Tatiana Romina Hartinger; Martin Milanic (Electron. Notes Discret. Math., 2016)

Packing Chromatic Number of Base-3 Sierpiński Graphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Graphs Comb., 2016)

Complexity of the game domination problem. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Gasper Kosmrlj; Gabriel Renault (Theor. Comput. Sci., 2016)

Uniformly dissociated graphs. - Bostjan Bresar; Bert L. Hartnell; Douglas F. Rall (Ars Math. Contemp., 2017)

Preface: Algorithmic Graph Theory on the Adriatic Coast. - Bostjan Bresar; Pinar Heggernes; Marcin Jakub Kaminski; Martin Milanic; Daniël Paulusma; Primoz Potocnik; Nicolas Trotignon (Discret. Appl. Math., 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)

Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs. - Bostjan Bresar (Discret. Math., 2017)

Packing chromatic number under local changes in a graph. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall; Kirsti Wash (Discret. Math., 2017)

How long can one bluff in the domination game?. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Gasper Kosmrlj (Discuss. Math. Graph Theory, 2017)

The game total domination problem is log-complete in PSPACE. - Bostjan Bresar; Michael A. Henning (Inf. Process. Lett., 2017)

Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor. - Bostjan Bresar; Sandi Klavzar (Art Discret. Appl. Math., 2018)

Domination parameters with number : Interrelations and algorithmic consequences. - Flavia Bonomo; Bostjan Bresar; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (Discret. Appl. Math., 2018)

1-perfectly orientable K4-minor-free and outerplanar graphs. - Bostjan Bresar; Tatiana Romina Hartinger; Tim Kos; Martin Milanic (Discret. Appl. Math., 2018)

On the number of maximal independent sets in minimum colorings of split graphs. - Bostjan Bresar; Nazanin Movarraei (Discret. Appl. Math., 2018)

Total dominating sequences in trees, split graphs, and under modular decomposition. - Bostjan Bresar; Tim Kos; Graciela L. Nasini; Pablo Daniel Torres (Discret. Optim., 2018)

An infinite family of subcubic graphs with unbounded packing chromatic number. - Bostjan Bresar; Jasmina Ferme (Discret. Math., 2018)

On total domination in the Cartesian product of graphs. - Bostjan Bresar; Tatiana Romina Hartinger; Tim Kos; Martin Milanic (Discuss. Math. Graph Theory, 2018)

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

Hitting subgraphs in P4-tidy graphs. - Bostjan Bresar; Tim Kos; Rastislav Krivos-Bellus; Gabriel Semanisin (Appl. Math. Comput., 2019)

Grundy domination and zero forcing in Kneser graphs. - Bostjan Bresar; Tim Kos; Pablo Daniel Torres (Ars Math. Contemp., 2019)

Independence number of products of Kneser graphs. - Bostjan Bresar; Mario Valencia-Pabon (Discret. Math., 2019)

Exact Distance Graphs of Product Graphs. - Bostjan Bresar; Nicolas Gastineau; Sandi Klavzar; Olivier Togni (Graphs Comb., 2019)

A 34-approximation of Vizing's conjecture for claw-free graphs. - Bostjan Bresar; Michael A. Henning (Discret. Appl. Math., 2020)

On the P3-hull number of Hamming graphs. - Bostjan Bresar; Mario Valencia-Pabon (Discret. Appl. Math., 2020)

Critical graphs for the chromatic edge-stability number. - Bostjan Bresar; Sandi Klavzar; Nazanin Movarraei (Discret. Math., 2020)

A survey on packing colorings. - Bostjan Bresar; Jasmina Ferme; Sandi Klavzar; Douglas F. Rall (Discuss. Math. Graph Theory, 2020)

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

S-packing colorings of distance graphs G(Z, {2, t}). - Bostjan Bresar; Jasmina Ferme; Karolína Kamenická (Discret. Appl. Math., 2021)

Indicated coloring game on Cartesian products of graphs. - Bostjan Bresar; Marko Jakovac; Dasa Stesl (Discret. Appl. Math., 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)

A new framework to approach Vizing's conjecture. - Bostjan Bresar; Bert L. Hartnell; Michael A. Henning; Kirsti Kuenzel; Douglas F. Rall (Discuss. Math. Graph Theory, 2021)

The geodesic-transversal problem. - Paul D. Manuel; Bostjan Bresar; Sandi Klavzar (Appl. Math. Comput., 2022)

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

Graphs that are critical for the packing chromatic number. - Bostjan Bresar; Jasmina Ferme (Discuss. Math. Graph Theory, 2022)

Domination in digraphs and their direct and Cartesian products. - Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (J. Graph Theory, 2022)

Orientable domination in product-like graphs. - Sarah E. Anderson; Bostjan Bresar; Sandi Klavzar; Kirsti Kuenzel; Douglas F. Rall (Discret. Appl. Math., 2023)

The geodesic transversal problem on some networks. - Paul D. Manuel; Bostjan Bresar; Sandi Klavzar (Comput. Appl. Math., 2023)

Graphs with equal Grundy domination and independence number. - Gábor Bacsó; Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (Discret. Optim., 2023)

Injective coloring of graphs revisited. - Bostjan Bresar; Babak Samadi; Ismael G. Yero (Discret. Math., 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)

Geodesic packing in graphs. - Paul D. Manuel; Bostjan Bresar; Sandi Klavzar (Appl. Math. Comput., 2023)

Computation of Grundy dominating sequences in (co-)bipartite graphs. - Bostjan Bresar; Arti Pandey; Gopika Sharma (Comput. Appl. Math., 2023)

Bootstrap Percolation in Strong Products of Graphs. - Bostjan Bresar; Jaka Hedzet (Electron. J. Comb., 2024)

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

Indicated domination game. - Bostjan Bresar; Csilla Bujtás; Vesna Irsic; Douglas F. Rall; Zsolt Tuza (Discret. Math., 2024)

Best possible upper bounds on the restrained domination number of cubic graphs. - Bostjan Bresar; Michael A. Henning (J. Graph Theory, 2024)

Edge open packing: Complexity, algorithmic aspects, and bounds. - Bostjan Bresar; Babak Samadi (Theor. Comput. Sci., 2024)

Lower (total) mutual-visibility number in graphs. - Bostjan Bresar; Ismael G. Yero (Appl. Math. Comput., 2024)

Packings in bipartite prisms and hypercubes. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2024)

S-packing colorings of distance graphs with distance sets of cardinality 2. - Bostjan Bresar; Jasmina Ferme; Premysl Holub; Marko Jakovac; Petra Melicharová (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)

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

Claw-free cubic graphs are (1,1,2,2)-colorable. - Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (Discret. Math., 2025)

Total $k$-coalition: bounds, exact values and an application to double coalition. - Bostjan Bresar; Sandi Klavzar; Babak Samadi (Discret. Math. Theor. Comput. Sci., 2025)

Injective Colorings of Sierpiński-like Graphs and Kneser Graphs. - Bostjan Bresar; Sandi Klavzar; Babak Samadi; Ismael G. Yero (Graphs Comb., 2025)