Raziskovalno delo

by | Jun 24, 2017 | Sporočila

  1. Vertex-, edge-, and total-colorings of Sierpiński-like graphs (with Sandi Klavžar), Discrete Math. 309 (2009), Pages: 1548–1556.
  2. The b-chromatic number of cubic graphs (with Sandi Klavžar), Graphs Combin. 28 (2010), Pages:107–118.
  3. On the b-chromatic number of regular graphs (with Sergio Cabello Justo), Discrete Appl. Math. 159 (2011), Pages: 1303–1310.
  4. On the b-chromatic number of some graph products (with Iztok Peterin), Studia Sci. Math. Hungar. 49 (2012), Pages: 156–169.
  5. On the vertex k-path cover (with Boštjan Brešar, Ján Katrenič,Gabriel Semanišin and Andrej Taranenko), Discrete Appl. Math. 161 (2013), Pages: 1943–1949.
  6. On the k-path vertex cover of some graph products (with Andrej Taranenko), Discrete Math. 313 (2013), Pages: 94–100.
  7. The partition dimension of strong product graphs and Cartesian product graphs (with Ismael González Yero, Dorota Kuziak and Andrej Taranenko), Discrete Math. 331 (2014), Pages: 43–52.
  8. A 2-parametric generalization of Sierpiński gasket graphs, Ars. Combin. 116 (2014), Pages: 395–405.
  9. The k-path vertex cover of rooted product graphs, Discrete Appl. Math. 187 (2015), Pages: 111–119.
  10. The b-chromatic index of a graph (with Iztok Peterin), Bull. Malays. Math. Sci. Soc. 38 (2015), Pages: 1375–1392.
  11. The security number of strong grid-like graphs (with Ismael González Yero and Dorota Kuziak), Theoret. Comput. Sci. 653 (2016), Pages: 1–14.
  12. On global (strong) defensive alliances in some product graphs (with Ismael González Yero and Dorota Kuziak), Commun. Comb. Optim. 2 (2017), Pages: 21–33.
  13. The b-chromatic number and related topics – A survey (with Iztok Peterin), Discrete Appl. Math. 235 (2018), Pages: 184–201.
  14. The security number of lexicographic products (with Tanja Gologranc and Iztok Peterin), Quaest. Math. 41(5) (2018), Pages: 601–613.
  15. Relating the total domination number and the annihilation number of cactus graphs and block graphs (with Csilla Bujtás), Ars Math. Contemp. 16 (2019), Pages: 183–202.
  16. Relating the annihilation number and the 2-domination number of block graphs, Discrete Appl. Math. 260 (2019), Pages: 178–187.
  17. S-packing chromatic vertex-critical graphs (with Přemysl Holub and Sandi Klavžar), Discrete Appl. Math. 285 (2020), Pages: 119–127.
  18. Indicated coloring game on Cartesian products of graphs (with Boštjan Brešar and Daša Štesl), Discrete Appl. Math. 289 (2021), Pages: 320–326.
  19. On the security number of the Cartesian product of graphs (with Yota Otachi), Discrete Appl. Math. 304 (2021), Pages: 119–128.
  20. On graphs with equal total domination and Grundy total domination numbers (with Tanja Gologranc, Tim Kos and Tilen Marc), Aequationes Math. 96 (2022), Pages: 137–146.
  21. The k-path vertex cover: general bounds and chordal graphs (with Csilla Bujtás and Zsolt Tuza), Networks 80(1) (2022), Pages: 63–76.
  22. On game chromatic vertex-critical graphs (with Daša Štesl), Bull. Malays. Math. Sci. Soc., 46 (2023), Article number: 27.
  23. S-packing colorings of distance graphs with distance sets of cardinality 2 (with Boštjan Brešar, Jasmina Ferme, Přemysl Holub and Petra Melicharová), Appl. Math. Comput., (2024), submitted.
  24. On the b-chromatic number of rooted product graphs (with Sarah Bockting-Conrad and Michael S. Lang), (2024).
Accessibility