| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Statistics of DKUM

Bibliography of the person, including all types of documents, not only theses.

PhD theses (2)

  1. Jasmina Ferme: Pakirna barvanja nekaterih razredov grafov z rekurzivno strukturo
  2. Karl Benkič: Prometno uravnoteženi usmerjevalni algoritmi za brezžična senzorska omrežja : doktorska disertacija

MSc theses (2)

  1. Klavdija Zelko: Meje za mavrična dominantna števila
  2. Anamarija Lakner: Grafi, ki dosežejo enakost v vizingovi domnevi

Other documents (83)

  1. Boštjan Brešar, Tanja Dravec, Daniel P. Johnston, Kirsti Kuenzel, Douglas F. Rall: Isolation game on graphs
  2. Boštjan Brešar, Tanja Dravec: Graphs with unique Grundy dominating sets
  3. Boštjan Brešar, Jaka Hedžet, Michael A. Henning: On polluted bootstrap percolation in Cartesian grids
  4. Boštjan Brešar, Tanja Dravec, Jaka Hedžet, Babak Samadi: Induced matching vs edge open packing: trees and product graphs
  5. Boštjan Brešar, Jasmina Ferme, Sandi Klavžar, Douglas F. Rall: A survey on packing colorings
  6. Boštjan Brešar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall: A new framework to approach Vizing's conjecture
  7. Boštjan Brešar, Daša Mesarič Štesl: The independence coloring game on graphs
  8. Boštjan Brešar, Csilla Bujtás, Tanja Dravec, Sandi Klavžar, Gašper Košmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer: On Grundy total domination number in product graphs
  9. Boštjan Brešar, Sandi Klavžar, Douglas F. Rall: Packings in bipartite prisms and hypercubes
  10. Sarah Anderson, Boštjan Brešar, Sandi Klavžar, Kirsti Kuenzel, Douglas F. Rall: Orientable domination in product-like graphs
  11. Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos, Martin Milanič: 1-perfectly orientable K[sub]4-minor-free and outerplanar graphs
  12. Ljubljana-Leoben graph theory seminar
  13. Boštjan Brešar, Sandi Klavžar, Gašper Košmrlj, Douglas F. Rall: Guarded subgraphs and the domination game
  14. Boštjan Brešar, Paul Dorbec, Sandi Klavžar, Gašper Košmrlj: How long can one bluff in the domination game?
  15. Boštjan Brešar, Wilfried Imrich, Sandi Klavžar: Tree-like isometric subgraphs of hypercubes
  16. Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh: The periphery graph of a median graph
  17. Boštjan Brešar: On Vizing's conjecture
  18. Boštjan Brešar, Pranava Jha, Sandi Klavžar, Blaž Zmazek: Median and quasi-median direct products of graphs
  19. Boštjan Brešar, Simon Špacapan: Edge-connectivity of strong products of graphs
  20. Boštjan Brešar: Arboreal structure and regular graphs of median-like classes
  21. Boštjan Brešar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavžar, Douglas F. Rall: Vizing's conjecture: a survey and recent results
  22. Boštjan Brešar, Tanja Dravec: On a local 3-Steiner convexity
  23. Boštjan Brešar: Scheide, Diego(D-ILTU-IM); Stiebitz, Michael(D-ILTU-IM): Vizing's coloring algorithm and the fan number. (English summary). - J. Graph Theory 65 (2010), no. 2, 115-138
  24. Boštjan Brešar: Hammack, Richard H.(1-VACW-MAM): A quasicancellation property for the direct product of graphs. (English summary). - Discrete Math. 310 (2010), no. 12, 1691-1696
  25. Boštjan Brešar: Alcón, L.(RA-UNLP); Faria, L.(BR-UERJPR); de Figueiredo, C. M. H.(BR-FRJ-E); Gutierrez, M.(RA-UNLP): On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. (English summary). - Discrete Appl. Math. 158 (2010), no. 12, 1279-1285
  26. Boštjan Brešar: Hou, Xin Min(PRC-HEF); Jiang, Fan(PRC-HEF): Paired domination of Cartesian products of graphs. (English summary). - J. Math. Res. Exposition 30 (2010), no. 1, 181-185
  27. Boštjan Brešar: Le, Van Bang(D-ROST-IF); Tuy, Nguyen Ngoc(D-ROST-IF): The square of a block graph. (English summary). - Discrete Math. 310 (2010), no. 4, 734-741
  28. Boštjan Brešar: Chang, Gerard J.(RC-NTAI); Wu, Jiaojiao(RC-NTAI); Zhu, Xuding: Rainbow domination on trees. (English summary). - Discrete Appl. Math. 158 (2010), no. 1, 8-12
  29. Boštjan Brešar: Wang, Hong(1-ID): Packing two copies of a sparse graph into a graph with restrained maximum degree. (English summary). - J. Graph Theory 62 (2009), no. 2, 178-187
  30. Boštjan Brešar: Hou, Xinmin(PRC-HEF); Lu, You(PRC-HEF): On the {k}-domination number of Cartesian products of graphs. (English summary). - Discrete Math. 309 (2009), no. 10, 3413-3419.
  31. Boštjan Brešar: Szabó, Jácint(H-EOTVO-IM): Good characterizations for some degree constrained subgraphs. (English summary). - J. Combin. Theory Ser. B 99 (2009), no. 2, 436-446
  32. Boštjan Brešar, Jérémie Chalopin, Victor Chepoi, Matjaž Kovše, Arnaud Labourel, Yann Vaxès: Retracts of products of chordal graphs
  33. Boštjan Brešar, Matjaž Kovše, Aleksandra Tepeh: Geodetic sets in graphs
  34. Boštjan Brešar: Böhme, Thomas (D-ILTU-IM); Gerlach, Tobias (D-ILTU-IM); Stiebitz, Michael (D-ILTU-IM): Ordered and linked chordal graphs. (English summary). - Discuss. Math. Graph Theory 28 (2008), no. 2, 367--373
  35. Boštjan Brešar: Karami, H.; Sheikholeslami, S. M.; Khodkar, Abdollah (1-WGA): Lower bounds on signed edge total domination numbers in graphs. (English summary). - Czechoslovak Math. J. 58(133) (2008), no. 3, 595--603
  36. Boštjan Brešar: Colbourn, Charles J. (1-AZS-CEN); Huybrechts, Cécile (B-ULB): Fully gated graphs: recognition and convex operations. (English summary). - Discrete Math. 308 (2008), no. 22, 5184--5195
  37. Boštjan Brešar: Parekh, Ojas (1-EMRY-CS): Approximation algorithms for partially covering with edges. (English summary). - Theoret. Comput. Sci. 400 (2008), no. 1-3, 159--168
  38. Boštjan Brešar: Offner, David (1-CMU): Polychromatic colorings of subcubes of the hypercube. (English summary). - SIAM J. Discrete Math. 22 (2008), no. 2, 450--454
  39. Boštjan Brešar: El-Zahar, Mohamed (ET-ASHS); Gravier, Sylvain (F-CNRS-GEF); Klobucar, Antoaneta: On the total domination number of cross products of graphs. (English summary). - Discrete Math. 308 (2008), no. 10, 2025--2029
  40. Boštjan Brešar: Bandelt, Hans-Jürgen (D-HAMBMI); Chepoi, Victor (F-XMAR2L-LIF): The algebra of metric betweenness. II. Geometry and equational characterization of weakly median graphs. (English summary). - European J. Combin. 29 (2008), no. 3, 676--700
  41. Boštjan Brešar: Gorše Pihler, Melita; Žerovnik, Janez (SV-MARME): Partial cubes are distance graphs. (English summary). - Discrete Math. 308 (2008), no. 5-6, 820--826.
  42. Drago Bokal, Boštjan Brešar, Janja Jerebic: A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
  43. Boštjan Brešar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavžar, Douglas F. Rall: Vizing's conjecture: a survey and recent results
  44. Boštjan Brešar, Tadeja Kraner Šumenjak: Cube intersection concepts in median graphs
  45. Boštjan Brešar, Aleksandra Tepeh: Cage-amalgamation graphs, a common generalization of chordal and median graphs
  46. Boštjan Brešar, Sandi Klavžar, Douglas F. Rall: Domination game
  47. Boštjan Brešar, Manoj Changat, Sandi Klavžar, Matjaž Kovše, Joseph Mathews, Antony Mathews: Cover-incomparability graphs of posets
  48. Boštjan Brešar, Sandi Klavžar, Aleksandra Tepeh: On the geodetic number and related metric sets in Cartesian product graphs
  49. Boštjan Brešar: Barát, János (H-SZEG-B); Varjú, Péter P. (H-SZEG-B): On square-free vertex colorings of graphs. (English summary). - Studia Sci. Math. Hungar. 44 (2007), no. 3, 411--422
  50. Boštjan Brešar: Klavžar, Sandi (SV-MARNM-MCS); Kovše, Matjaž: On [Theta]-graphs of partial cubes. (English summary). - Discuss. Math. Graph Theory 27 (2007), no. 2, 313--321
  51. Boštjan Brešar: Bandelt, Hans-Jürgen (D-HAMB); Chepoi, Victor (F-XMAR2L-LIF): The algebra of metric betweenness. I. Subdirect representation and retraction. (English summary). - European J. Combin. 28 (2007), no. 6, 1640--1661
  52. Boštjan Brešar: Alon, Noga (1-IASP-SM); Lubetzky, Eyal (IL-TLAV): Graph powers, Delsarte, Hoffman, Ramsey, and Shannon. (English summary). - SIAM J. Discrete Math. 21 (2007), no. 2, 329--348 (electronic)
  53. Boštjan Brešar, Aleksandra Tepeh: On the geodetic number of median graphs
  54. T. Bartnicki, Boštjan Brešar, J. Grytczuk, Matjaž Kovše, Z. Miechowicz, Iztok Peterin: Game chromatic number of Cartesian product graphs
  55. Boštjan Brešar: Alon, Noga(IL-TLAV-C); Lubetzky, Eyal(IL-TLAV-C): Codes and XOR graph products. (English summary). - Combinatorica 27 (2007), no. 1, 13--33
  56. Boštjan Brešar: Chaouche, F. Affif(DZ-BOUMM); Berrachedi, A.(DZ-BOUMM): Some bounds for the b-chromatic number of a generalized Hamming graphs. (English summary). - Far East J. Appl. Math. 26 (2007), no. 3, 375--391
  57. Boštjan Brešar: Dvořák, Tomáš(CZ-KARLMP): Dense sets and embedding binary trees into hypercubes. (English summary). - Discrete Appl. Math. 155 (2007), no. 4, 506--514
  58. Boštjan Brešar: Cáceres, J.(E-ALM-SAM); Grima, C. I.(E-SEVL-A1); Márquez, A.(E-SEVL-A1); Moreno-González, A.(E-SEVL-A1): Dilation-free graphs in the l[sub]1 metric. (English summary). - Networks 49 (2007), no. 2, 168--174
  59. Boštjan Brešar, Aleksandra Tepeh: Crossing graphs of fiber-complemented graphs
  60. Boštjan Brešar, Sandi Klavžar, Douglas F. Rall: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
  61. Boštjan Brešar, Sandi Klavžar, Douglas F. Rall: Dominating direct products of graphs
  62. Boštjan Brešar, Sandi Klavžar: Maximal proper subgraphs of median graphs
  63. Boštjan Brešar: Characterizing almost-median graphs
  64. Boštjan Brešar, J. Grytczuk, Sandi Klavžar, S. Niwczyk, Iztok Peterin: Nonrepetitive colorings of trees
  65. Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: On cube-free median graphs
  66. Boštjan Brešar, Michael A. Henning, Sandi Klavžar: On integer domination in graphs and Vizing-like problems
  67. Boštjan Brešar, Sandi Klavžar: [Theta]-graceful labelings of partial cubes
  68. Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: Roots of cube polynomials of median graphs
  69. Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: The cube polynomial and its derivatives: the case of median graphs
  70. Boštjan Brešar, Sandi Klavžar, Douglas F. Rall: Domination game played on trees and spanning subgraphs
  71. Boštjan Brešar, Manoj Changat, Sandi Klavžar, Joseph Mathews, Antony Mathews, Prasanth G. Narasimha-Shenoi: Characterizing posets for which their natural transit functions coincide
  72. Kannan Balakrishnan, Boštjan Brešar, Manoj Changat, Wilfried Imrich, Sandi Klavžar, Matjaž Kovše, Ajitha R. Subhamathi: Median graphs, the remoteness function, periphery transversals, and geodetic number two
  73. Boštjan Brešar, Sandi Klavžar, Alenka Lipovec, Bojan Mohar: Cubic inflation, mirror graphs, regular maps, and partial cubes
  74. Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: Roots of cube polynomials of median graphs
  75. Boštjan Brešar, Sandi Klavžar, Riste Škrekovski: On cube-free median graphs
  76. Boštjan Brešar: Fitzpatrick Shannon L., Janssen Jeannette, Nowakowski Richard J.: Fractional isometric path number. Australas. J. Combin. 34 (2006), 281-298.
  77. Boštjan Brešar: Dress Andreas, Huber Katharina T., Lesser Alice, Moulton Vincent: Hereditarily optimal realizations of consistent metrics. Ann. Comb. 10 (2006), no. 1, 63-76
  78. Boštjan Brešar: Eischen Ellen E.: Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter. Discrete Math. 306 (2006), no. 8-9, 745-761
  79. Boštjan Brešar: Chastand Marc, Polat Norbert: On geodesic structures of weakly median graphs.I. Decomposition and octahedral graphs. Discrete Math. 306 (2006), no. 13, 1272-1284
  80. Boštjan Brešar: Jerebic Janja, Klavzar Sandi: On induced and isometric embeddings of graphs into the strong product of paths. Discrete Math. 306 (2006), no. 13, 1358-1363.
  81. Boštjan Brešar: Chastand Marc, Polat Norbert: On geodesic structures of weakly median graphs.II. Compactness, the role of isometric rays. Discrete Math. 306 (2006), no. 16, 1846-1861.
  82. Boštjan Brešar: Nebesk'y Ladislav: Signpost systems and spanning trees of graphs, Czechoslovak Math. J. 56(131) (2006), no. 3, 885-893.
  83. Boštjan Brešar: Chepoi Victor, Dragan Feodor F., Vaxes Yann: Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61 (2006), no. 2, 60-88.
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica