Iztok Peterin

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 24

Top Topics

Grows Quadratically

Convexity Measure

Top Venues

Discret. Appl. Math.

Comput. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Discuss. Math. Graph Theory

Publications

Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero
Resolving vertices of graphs with differences. Comput. Appl. Math. 43 (5) (2024)
Magda Dettlaff, Hanna Furmanczyk, Iztok Peterin, Adriana Roux, Radoslaw Ziemann
A new approach to b-coloring of regular graphs. Appl. Math. Comput. 481 (2024)
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin
On b-acyclic chromatic number of a graph. Comput. Appl. Math. 42 (1) (2023)
Aleksander Kelenc, Iztok Peterin
On some metric properties of direct-co-direct product. Appl. Math. Comput. 457 (2023)
Aleksander Kelenc, Iztok Peterin
Distance formula for direct-co-direct product in the case of disconnected factors. Art Discret. Appl. Math. 6 (2) (2023)
Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes. CALDAM (2023)
Dragana Bozovic, Iztok Peterin
Graphs with unique maximum packing of closed neighborhoods. Discuss. Math. Graph Theory 42 (3) (2022)
Dragana Bozovic, Aleksander Kelenc, Iztok Peterin, Ismael G. Yero
Incidence dimension and 2-packing number in graphs. RAIRO Oper. Res. 56 (1) (2022)
Iztok Peterin, Gabriel Semanisin
Geodesic transversal problem for join and lexicographic product of graphs. Comput. Appl. Math. 41 (4) (2022)
Sandi Klavzar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero
A Steiner general position problem in graph theory. Comput. Appl. Math. 40 (6) (2021)
Abel Cabrera Martínez, Iztok Peterin, Ismael González Yero
Independent transversal total domination versus total domination in trees. Discuss. Math. Graph Theory 41 (1) (2021)
Dragana Bozovic, Iztok Peterin
A note on the packing chromatic number of lexicographic products. Discret. Appl. Math. 293 (2021)
Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero
On three outer-independent domination related parameters in graphs. Discret. Appl. Math. 294 (2021)
Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero
(Open) packing number of some graph products. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Michael A. Henning, Iztok Peterin
A characterization of graphs with disjoint total dominating sets. Ars Math. Contemp. 16 (2) (2019)
Iztok Peterin, Ismael González Yero
Efficient closed domination in digraph products. J. Comb. Optim. 38 (1) (2019)
Erika Fecková Skrabul'áková, Iztok Peterin, Jens Schreyer, Andrej Taranenko
A note on the Thue chromatic number of lexicographic produts of graphs. Discuss. Math. Graph Theory 38 (3) (2018)
Dorota Kuziak, Iztok Peterin, Ismael González Yero
-monopoly number of strong product graphs. Discuss. Math. Graph Theory 38 (1) (2018)
Marko Jakovac, Iztok Peterin
The b-chromatic number and related topics - A survey. Discret. Appl. Math. 235 (2018)
Wilfried Imrich, Iztok Peterin
Cartesian products of directed graphs with loops. Discret. Math. 341 (5) (2018)
Sandi Klavzar, Iztok Peterin, Ismael González Yero
Graphs that are simultaneously efficient open domination and efficient closed domination graphs. Discret. Appl. Math. 217 (2017)
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin
Spectra of graphs and closed distance magic labelings. Discret. Math. 339 (7) (2016)
Dorota Kuziak, Iztok Peterin, Ismael González Yero
Open k-monopolies in graphs: complexity and related concepts. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Tadeja Kraner Sumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh
Partitioning the vertex set of G to make G ☐ H an efficient open domination graph. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Ivo Koch, Iztok Peterin
The b-chromatic index of direct product of graphs. Discret. Appl. Math. (2015)
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh
Distance Magic Labeling and Two Products of Graphs. Graphs Comb. 31 (5) (2015)
Liliana Alcón, Bostjan Bresar, Tanja Gologranc, Marisa Gutierrez, Tadeja Kraner Sumenjak, Iztok Peterin, Aleksandra Tepeh
Toll convexity. Eur. J. Comb. 46 (2015)
Manoj Changat, Divya Sindhu Lekha, Iztok Peterin, Ajitha R. Subhamathi, Simon Spacapan
The median game. Discret. Optim. 17 (2015)
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh
Group distance magic labeling of direct product of graphs. Ars Math. Contemp. 9 (1) (2015)
Iztok Fister, Iztok Peterin, Marjan Mernik, Matej Crepinsek
Hybrid evolutionary algorithm for the b-chromatic number. J. Heuristics 21 (4) (2015)
Tanja Gologranc, Gasper Mekis, Iztok Peterin
Rainbow Connection and Graph Products. Graphs Comb. 30 (3) (2014)
Bijo S. Anand, Manoj Changat, Iztok Peterin, Prasanth G. Narasimha-Shenoi
Some Steiner concepts on lexicographic products of graphs. Discret. Math. Algorithms Appl. 6 (4) (2014)
Dorota Kuziak, Iztok Peterin, Ismael González Yero
Efficient open domination in graph products. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Iztok Peterin
Quasi-almostmedian graphs. Ars Comb. 108 (2013)
Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Geetha Seethakuttyamma, Simon Spacapan
A forbidden subgraph characterization of some graph classes using betweenness axioms. Discret. Math. 313 (8) (2013)
Iztok Peterin
Intervals and Convex Sets in Strong Product of Graphs. Graphs Comb. 29 (3) (2013)
Sandi Klavzar, Iztok Peterin, Sara Sabrina Zemljic
Hamming dimension of a graph - The case of Sierpiński graphs. Eur. J. Comb. 34 (2) (2013)
Iztok Peterin
The pre-hull number and lexicographic product. Discret. Math. 312 (14) (2012)
Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin
Convex Sets in Lexicographic Products of Graphs. Graphs Comb. 28 (1) (2012)
Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Aleksandra Tepeh
A note on 3-Steiner intervals and betweenness. Discret. Math. 311 (22) (2011)
Manoj Changat, Joseph Mathews, Prasanth G. Narasimha-Shenoi, Iztok Peterin
-ary transit functions in graphs. Discuss. Math. Graph Theory 30 (4) (2010)
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang
NZ-flows in strong products of graphs. J. Graph Theory 64 (4) (2010)
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) (2009)
Kannan Balakrishnan, Manoj Changat, Iztok Peterin, Simon Spacapan, Primoz Sparl, Ajitha R. Subhamathi
Strongly distance-balanced graphs and graph products. Eur. J. Comb. 30 (5) (2009)
Iztok Peterin
A characterization of planar partial cubes. Discret. Math. 308 (24) (2008)
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)
Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan
Antimedian graphs. Australas. J Comb. 41 (2008)
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert
Fast recognition of classes of almost-median graphs. Discret. Math. 307 (3-5) (2007)
Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin
Nonrepetitive colorings of trees. Discret. Math. 307 (2) (2007)
Wilfried Imrich, Iztok Peterin
Recognizing Cartesian products in linear time. Discret. Math. 307 (3-5) (2007)
Iztok Peterin
Game chromatic number of Cartesian product graphs. Electron. Notes Discret. Math. 29 (2007)
Iztok Peterin
A charaterization of planar median graphs. Discuss. Math. Graph Theory 26 (1) (2006)
Sandi Klavzar, Iztok Peterin
Characterizing subgraphs of Hamming graphs. J. Graph Theory 49 (4) (2005)
Iztok Peterin
Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs. Order 21 (4) (2004)