default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBostjan Bresar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j124]Bostjan Bresar
, Ismael G. Yero:
Lower (total) mutual-visibility number in graphs. Appl. Math. Comput. 465: 128411 (2024)- [j123]Bostjan Bresar, Tanja Dravec, Aysel Erey, Jaka Hedzet:
Spreading in graphs. Discret. Appl. Math. 353: 139-150 (2024) - [j122]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Packings in bipartite prisms and hypercubes. Discret. Math. 347(4): 113875 (2024) - [j121]Bostjan Bresar, Csilla Bujtás, Vesna Irsic, Douglas F. Rall, Zsolt Tuza:
Indicated domination game. Discret. Math. 347(9): 114060 (2024) - [j120]Bostjan Bresar, Babak Samadi:
Edge open packing: Complexity, algorithmic aspects, and bounds. Theor. Comput. Sci. 1022: 114884 (2024) - [i6]Bostjan Bresar, Babak Samadi:
Edge open packing: complexity, algorithmic aspects, and bounds. CoRR abs/2403.00750 (2024) - 2023
- [j119]Bostjan Bresar, Tanja Dravec, Elzbieta Kleszcz:
Uniquely colorable graphs up to automorphisms. Appl. Math. Comput. 450: 128007 (2023) - [j118]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
Geodesic packing in graphs. Appl. Math. Comput. 459: 128277 (2023) - [j117]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
The geodesic transversal problem on some networks. Comput. Appl. Math. 42(1) (2023) - [j116]Bostjan Bresar, Arti Pandey, Gopika Sharma:
Computation of Grundy dominating sequences in (co-)bipartite graphs. Comput. Appl. Math. 42(8): 359 (2023) - [j115]Sarah E. Anderson, Bostjan Bresar, Sandi Klavzar, Kirsti Kuenzel, Douglas F. Rall:
Orientable domination in product-like graphs. Discret. Appl. Math. 326: 62-69 (2023) - [j114]Gábor Bacsó, Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall:
Graphs with equal Grundy domination and independence number. Discret. Optim. 48(Part 2): 100777 (2023) - [j113]Bostjan Bresar, Babak Samadi, Ismael G. Yero:
Injective coloring of graphs revisited. Discret. Math. 346(5): 113348 (2023) - [j112]Saieed Akbari, Arash Beikmohammadi, Bostjan Bresar, Tanja Dravec, Mohammad Mahdi Habibollahi, Nazanin Movarraei:
On the chromatic edge stability index of graphs. Eur. J. Comb. 111: 103690 (2023) - 2022
- [j111]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
The geodesic-transversal problem. Appl. Math. Comput. 413: 126621 (2022) - [j110]Bostjan Bresar, Tanja Dravec, Aleksandra Gorzkowska, Elzbieta Kleszcz:
Graphs with a unique maximum independent set up to automorphisms. Discret. Appl. Math. 317: 124-135 (2022) - [j109]Bostjan Bresar, Jasmina Ferme:
Graphs that are critical for the packing chromatic number. Discuss. Math. Graph Theory 42(2): 569-589 (2022) - [j108]Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall:
Domination in digraphs and their direct and Cartesian products. J. Graph Theory 99(3): 359-377 (2022) - [i5]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
Geodesic packing in graphs. CoRR abs/2210.15325 (2022) - 2021
- [j107]Bostjan Bresar, Marko Jakovac, Dasa Stesl:
Indicated coloring game on Cartesian products of graphs. Discret. Appl. Math. 289: 320-326 (2021) - [j106]Bostjan Bresar, Jasmina Ferme, Karolína Kamenická:
S-packing colorings of distance graphs G(Z, {2, t}). Discret. Appl. Math. 298: 143-154 (2021) - [j105]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41(1): 225-247 (2021) - [j104]Bostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall:
A new framework to approach Vizing's conjecture. Discuss. Math. Graph Theory 41(3): 749-762 (2021) - [i4]Bostjan Bresar, Tanja Dravec:
Graphs with unique zero forcing sets and Grundy dominating sets. CoRR abs/2103.10172 (2021) - 2020
- [j103]Bostjan Bresar, Mario Valencia-Pabon:
On the P3-hull number of Hamming graphs. Discret. Appl. Math. 282: 48-52 (2020) - [j102]Bostjan Bresar, Michael A. Henning:
A 34-approximation of Vizing's conjecture for claw-free graphs. Discret. Appl. Math. 284: 416-422 (2020) - [j101]Bostjan Bresar, Sandi Klavzar, Nazanin Movarraei:
Critical graphs for the chromatic edge-stability number. Discret. Math. 343(6): 111845 (2020) - [j100]Bostjan Bresar, Jasmina Ferme, Sandi Klavzar, Douglas F. Rall:
A survey on packing colorings. Discuss. Math. Graph Theory 40(4): 923-970 (2020)
2010 – 2019
- 2019
- [j99]Bostjan Bresar, Tim Kos, Rastislav Krivos-Bellus, Gabriel Semanisin:
Hitting subgraphs in P4-tidy graphs. Appl. Math. Comput. 352: 211-219 (2019) - [j98]Bostjan Bresar, Tim Kos, Pablo Daniel Torres:
Grundy domination and zero forcing in Kneser graphs. Ars Math. Contemp. 17(2): 419-430 (2019) - [j97]Bostjan Bresar, Mario Valencia-Pabon:
Independence number of products of Kneser graphs. Discret. Math. 342(4): 1017-1027 (2019) - [j96]Bostjan Bresar, Nicolas Gastineau, Sandi Klavzar, Olivier Togni:
Exact Distance Graphs of Product Graphs. Graphs Comb. 35(6): 1555-1569 (2019) - 2018
- [j95]Bostjan Bresar, Sandi Klavzar:
Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor. Art Discret. Appl. Math. 1(1): #N1.02 (2018) - [j94]Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Domination parameters with number : Interrelations and algorithmic consequences. Discret. Appl. Math. 235: 23-50 (2018) - [j93]Bostjan Bresar, Nazanin Movarraei:
On the number of maximal independent sets in minimum colorings of split graphs. Discret. Appl. Math. 247: 352-356 (2018) - [j92]Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. Discret. Appl. Math. 248: 33-45 (2018) - [j91]Bostjan Bresar, Tim Kos, Graciela L. Nasini, Pablo Daniel Torres:
Total dominating sequences in trees, split graphs, and under modular decomposition. Discret. Optim. 28: 16-30 (2018) - [j90]Bostjan Bresar, Jasmina Ferme:
An infinite family of subcubic graphs with unbounded packing chromatic number. Discret. Math. 341(8): 2337-2342 (2018) - [j89]Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
On total domination in the Cartesian product of graphs. Discuss. Math. Graph Theory 38(4): 963-976 (2018) - [j88]Bostjan Bresar, Tanja Gologranc, Tim Kos:
Convex and isometric domination of (weak) dominating pair graphs. Theor. Comput. Sci. 730: 32-43 (2018) - 2017
- [j87]Bostjan Bresar, Bert L. Hartnell, Douglas F. Rall:
Uniformly dissociated graphs. Ars Math. Contemp. 13(2): 293-306 (2017) - [j86]Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon:
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231: 1-3 (2017) - [j85]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26: 66-77 (2017) - [j84]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall, Kirsti Wash:
Packing chromatic number under local changes in a graph. Discret. Math. 340(5): 1110-1115 (2017) - [j83]Bostjan Bresar:
Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs. Discret. Math. 340(10): 2398-2401 (2017) - [j82]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj:
How long can one bluff in the domination game?. Discuss. Math. Graph Theory 37(2): 337-352 (2017) - [j81]Bostjan Bresar, Michael A. Henning:
The game total domination problem is log-complete in PSPACE. Inf. Process. Lett. 126: 12-17 (2017) - [i3]Bostjan Bresar, Tanja Gologranc, Tim Kos:
Convex and isometric domination of (weak) dominating pair graphs. CoRR abs/1704.08484 (2017) - 2016
- [j80]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j79]Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Total dominating sequences in graphs. Discret. Math. 339(6): 1665-1676 (2016) - [j78]Bostjan Bresar, Tim Kos, Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. Electron. Notes Discret. Math. 54: 199-204 (2016) - [j77]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Packing Chromatic Number of Base-3 Sierpiński Graphs. Graphs Comb. 32(4): 1313-1327 (2016) - [j76]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault:
Complexity of the game domination problem. Theor. Comput. Sci. 648: 1-7 (2016) - 2015
- [j75]Bostjan Bresar:
Vizing's Conjecture for Graphs with Domination Number 3 - a New Proof. Electron. J. Comb. 22(3): 3 (2015) - [j74]Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Guarded subgraphs and the domination game. Discret. Math. Theor. Comput. Sci. 17(1): 161-168 (2015) - [j73]Liliana Alcón, Bostjan Bresar, Tanja Gologranc, Marisa Gutierrez, Tadeja Kraner Sumenjak, Iztok Peterin, Aleksandra Tepeh:
Toll convexity. Eur. J. Comb. 46: 161-175 (2015) - [j72]Bostjan Bresar, Douglas F. Rall:
On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway. Graphs Comb. 31(5): 1263-1270 (2015) - [j71]Bostjan Bresar, Tanja Gologranc, Manoj Changat, Baiju Sukumaran:
Cographs Which are Cover-Incomparability Graphs of Posets. Order 32(2): 179-187 (2015) - [i2]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault:
Complexity of the Game Domination Problem. CoRR abs/1510.00140 (2015) - 2014
- [j70]Bostjan Bresar, Tadeja Kraner Sumenjak:
The hypergraph of θ-classes and θ-graphs of partial cubes. Ars Comb. 113: 225-239 (2014) - [j69]Bostjan Bresar, Rastislav Krivos-Bellus, Gabriel Semanisin, Priomoz Sparl:
On the weighted k-path vertex cover problem. Discret. Appl. Math. 177: 14-18 (2014) - [j68]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Aleksander Vesel, Petra Zigert Pletersek:
Equal opportunity networks, distance-balanced graphs, and Wiener game. Discret. Optim. 12: 150-154 (2014) - [j67]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj:
Domination game: Effect of edge- and vertex-removal. Discret. Math. 330: 1-10 (2014) - [j66]Bostjan Bresar, Tanja Gologranc, Martin Milanic, Douglas F. Rall, Romeo Rizzi:
Dominating sequences in graphs. Discret. Math. 336: 22-36 (2014) - 2013
- [j65]Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Domination game: Extremal families of graphs for 3/53/5-conjectures. Discret. Appl. Math. 161(10-11): 1308-1316 (2013) - [j64]Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko:
On the vertex kk-path cover. Discret. Appl. Math. 161(13-14): 1943-1949 (2013) - [j63]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination game played on trees and spanning subgraphs. Discret. Math. 313(8): 915-923 (2013) - [j62]Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès:
Retracts of Products of Chordal Graphs. J. Graph Theory 73(2): 161-180 (2013) - 2012
- [j61]Drago Bokal, Bostjan Bresar, Janja Jerebic:
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks. Discret. Appl. Math. 160(4-5): 460-470 (2012) - [j60]Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. J. Graph Theory 69(1): 46-76 (2012) - 2011
- [j59]Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin:
Minimum k-path vertex cover. Discret. Appl. Math. 159(12): 1189-1195 (2011) - [j58]Bostjan Bresar, Tadeja Kraner Sumenjak, Aleksandra Tepeh Horvat:
The geodetic number of the lexicographic product of graphs. Discret. Math. 311(16): 1693-1698 (2011) - [j57]Bostjan Bresar, Tanja Gologranc:
On a local 3-Steiner convexity. Eur. J. Comb. 32(8): 1222-1235 (2011) - [p1]Bostjan Bresar, Matjaz Kovse, Aleksandra Tepeh:
Geodetic Sets in Graphs. Structural Analysis of Complex Networks 2011: 197-218 - 2010
- [j56]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
Computing median and antimedian sets in median graphs. Algorithmica 57(2): 207-216 (2010) - [j55]Bostjan Bresar, Manoj Changat, Tanja Gologranc, Joseph Mathews, Antony Mathews:
Cover-incomparability graphs and chordal graphs. Discret. Appl. Math. 158(16): 1752-1759 (2010) - [j54]Bostjan Bresar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh Horvat:
The periphery graph of a median graph. Discuss. Math. Graph Theory 30(1): 17-32 (2010) - [j53]Kannan Balakrishnan, Bostjan Bresar, Matjaz Kovse, Manoj Changat, Ajitha R. Subhamathi, Sandi Klavzar:
Simultaneous embeddings of graphs as median and antimedian subgraphs. Networks 56(2): 90-94 (2010) - [j52]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination Game and an Imagination Strategy. SIAM J. Discret. Math. 24(3): 979-991 (2010) - [i1]Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin:
Minimum k-path vertex cover. CoRR abs/1012.2088 (2010)
2000 – 2009
- 2009
- [j51]Bostjan Bresar, Simon Spacapan:
Broadcast domination of products of graphs. Ars Comb. 92 (2009) - [j50]Bostjan Bresar, Tadeja Kraner Sumenjak:
θ-graphs of partial cubes and strong edge colorings. Ars Comb. 93 (2009) - [j49]Bostjan Bresar, Manoj Changat, Sandi Klavzar, Joseph Mathews, Antony Mathews, Prasanth G. Narasimha-Shenoi:
Characterizing posets for which their natural transit functions coincide. Ars Math. Contemp. 2(1): 27-33 (2009) - [j48]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
On the remoteness function in median graphs. Discret. Appl. Math. 157(18): 3679-3688 (2009) - [j47]Bostjan Bresar, Tadeja Kraner Sumenjak:
Cube intersection concepts in median graphs. Discret. Math. 309(10): 2990-2997 (2009) - [j46]Bostjan Bresar, Manoj Changat, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Aleksandra Tepeh Horvat:
Steiner intervals, geodesic intervals, and betweenness. Discret. Math. 309(20): 6114-6125 (2009) - [j45]Bostjan Bresar, Aleksandra Tepeh Horvat:
Cage-amalgamation graphs, a common generalization of chordal and median graphs. Eur. J. Comb. 30(5): 1071-1081 (2009) - [j44]Bostjan Bresar, Douglas F. Rall:
Fair reception and Vizing's conjecture. J. Graph Theory 61(1): 45-54 (2009) - 2008
- [j43]Bostjan Bresar, Simon Spacapan:
On the connectivity of the direct product of graphs. Australas. J Comb. 41: 45-56 (2008) - [j42]Tomasz Bartnicki, Bostjan Bresar, Jaroslaw Grytczuk, Matjaz Kovse, Zofia Miechowicz, Iztok Peterin:
Game Chromatic Number of Cartesian Product Graphs. Electron. J. Comb. 15(1) (2008) - [j41]Bostjan Bresar, Aleksandra Tepeh Horvat:
Crossing graphs of fiber-complemented graphs. Discret. Math. 308(7): 1176-1184 (2008) - [j40]Bostjan Bresar, Aleksandra Tepeh Horvat:
On the geodetic number of median graphs. Discret. Math. 308(18): 4044-4051 (2008) - [j39]Bostjan Bresar, Sandi Klavzar, Aleksandra Tepeh Horvat:
On the geodetic number and related metric sets in Cartesian product graphs. Discret. Math. 308(23): 5555-5561 (2008) - [j38]Douglas F. Rall, Bostjan Bresar, Art S. Finbow, Sandi Klavzar:
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. Electron. Notes Discret. Math. 30: 57-61 (2008) - [j37]Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Joseph Mathews, Antony Mathews:
Cover-Incomparability Graphs of Posets. Order 25(4): 335-347 (2008) - 2007
- [j36]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Discret. Appl. Math. 155(17): 2303-2311 (2007) - [j35]Bostjan Bresar, Tadeja Kraner Sumenjak:
On the 2-rainbow domination in graphs. Discret. Appl. Math. 155(17): 2394-2400 (2007) - [j34]Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin:
Nonrepetitive colorings of trees. Discret. Math. 307(2): 163-172 (2007) - [j33]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
On cube-free median graphs. Discret. Math. 307(3-5): 345-351 (2007) - [j32]Bostjan Bresar, Sandi Klavzar:
Maximal proper subgraphs of median graphs. Discret. Math. 307(11-12): 1389-1394 (2007) - [j31]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Dominating direct products of graphs. Discret. Math. 307(13): 1636-1642 (2007) - [j30]Bostjan Bresar, Simon Spacapan:
Edge-connectivity of strong products of graphs. Discuss. Math. Graph Theory 27(2): 333-343 (2007) - [j29]Bostjan Bresar:
Characterizing almost-median graphs. Eur. J. Comb. 28(3): 916-920 (2007) - [j28]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Michel Mollard:
Hamming polynomials and their partial derivatives. Eur. J. Comb. 28(4): 1156-1162 (2007) - [j27]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Electron. Notes Discret. Math. 29: 237-241 (2007) - [j26]Bostjan Bresar, Sandi Klavzar:
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs. SIAM J. Discret. Math. 21(1): 26-32 (2007) - 2006
- [j25]Bostjan Bresar, Sandi Klavzar:
Theta-graceful labelings of partial cubes. Discret. Math. 306(13): 1264-1271 (2006) - [j24]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Roots of cube polynomials of median graphs. J. Graph Theory 52(1): 37-50 (2006) - 2005
- [j23]Bostjan Bresar:
Vizing-like Conjecture for the Upper Domination of Cartesian Products of Graphs - The Proof. Electron. J. Comb. 12 (2005) - [j22]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discret. Math. 297(1-3): 159-166 (2005) - [j21]Bostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Median and quasi-median direct products of graphs. Discuss. Math. Graph Theory 25(1-2): 183-196 (2005) - [j20]Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Paired-domination of Cartesian products of graphs and rainbow domination. Electron. Notes Discret. Math. 22: 233-237 (2005) - [j19]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek:
Hypercubes As Direct Products. SIAM J. Discret. Math. 18(4): 778-786 (2005) - 2004
- [j18]Bostjan Bresar, Sandi Klavzar:
Square-free colorings of graphs. Ars Comb. 70 (2004) - [j17]Bostjan Bresar:
On subgraphs of Cartesian product graphs and S-primeness. Discret. Math. 282(1-3): 43-52 (2004) - [j16]Bostjan Bresar, Sandi Klavzar, Alenka Lipovec, Bojan Mohar:
Cubic inflation, mirror graphs, regular maps, and partial cubes. Eur. J. Comb. 25(1): 54-64 (2004) - 2003
- [j15]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
The Cube Polynomial and its Derivatives: the Case of Median Graphs. Electron. J. Comb. 10 (2003) - [j14]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Fast recognition algorithms for classes of partial cubes. Discret. Appl. Math. 131(1): 51-61 (2003) - [j13]Bostjan Bresar, Blaz Zmazek:
On the independence graph of a graph. Discret. Math. 272(2-3): 263-268 (2003) - [j12]Bostjan Bresar:
Arboreal structure and regular graphs of median-like classes. Discuss. Math. Graph Theory 23(2): 215-225 (2003) - [j11]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Tree-like isometric subgraphs of hypercubes. Discuss. Math. Graph Theory 23(2): 227-240 (2003) - [j10]Bostjan Bresar:
Intersection graphs of maximal hypercubes. Eur. J. Comb. 24(2): 195-209 (2003) - [j9]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Quasi-median graphs, their generalizations, and tree-like equalities. Eur. J. Comb. 24(5): 557-572 (2003) - 2002
- [j8]Bostjan Bresar:
The direct expansion of graphs. Discret. Math. 244(1-3): 17-30 (2002) - [j7]Bostjan Bresar:
On the Natural Imprint Function of a Graph. Eur. J. Comb. 23(2): 149-161 (2002) - [j6]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
Tiled partial cubes. J. Graph Theory 40(2): 91-103 (2002) - 2001
- [j5]Bostjan Bresar:
Partial Hamming graphs and expansion procedures. Discret. Math. 237(1-3): 13-27 (2001) - [j4]Bostjan Bresar:
On Vizing's conjecture. Discuss. Math. Graph Theory 21(1): 5-11 (2001) - [j3]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Cubes polynomial and its derivatives. Electron. Notes Discret. Math. 10: 47-49 (2001) - 2000
- [j2]Bostjan Bresar:
On subgraphs of Cartesian product graphs and S-primeness. Electron. Notes Discret. Math. 5: 42-45 (2000)
1990 – 1999
- 1999
- [j1]Bostjan Bresar:
On clique-gated graphs. Discret. Math. 199(1-3): 201-205 (1999)
Coauthor Index
Tanja Dravec
aka: Tanja Gologranc
aka: Tanja Gologranc
[j122] [j118] [j117] [j115] [j111] [i5] [j105] [j101] [j100] [j96] [j95] [j85] [j84] [j82] [j80] [j77] [j76] [j74] [i2] [j68] [j67] [j65] [j63] [j60] [j56] [j53] [j52] [j49] [j48] [j39] [j38] [j37] [j36] [j34] [j33] [j32] [j31] [j28] [j27] [j26] [j25] [j24] [j22] [j21] [j19] [j18] [j16] [j15] [j14] [j11] [j9] [j6] [j3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
