Iztok Peterin

According to our database, Iztok Peterin authored at least 54 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Resolving vertices of graphs with differences.

Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero

Comput. Appl. Math., July, 2024

A new approach to b-coloring of regular graphs.

Magda Dettlaff, Hanna Furmanczyk, Iztok Peterin, Adriana Roux, Radoslaw Ziemann

Appl. Math. Comput., 2024

2023

On some metric properties of direct-co-direct product.

Aleksander Kelenc, Iztok Peterin

Appl. Math. Comput., November, 2023

On b-acyclic chromatic number of a graph.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Comput. Appl. Math., February, 2023

Distance formula for direct-co-direct product in the case of disconnected factors.

Aleksander Kelenc, Iztok Peterin

Art Discret. Appl. Math., January, 2023

Axiomatic Characterization of the Toll Walk Function of Some Graph Classes.

Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Geodesic transversal problem for join and lexicographic product of graphs.

Iztok Peterin, Gabriel Semanisin

Comput. Appl. Math., June, 2022

Incidence dimension and 2-packing number in graphs.

Dragana Bozovic, Aleksander Kelenc, Iztok Peterin, Ismael G. Yero

RAIRO Oper. Res., 2022

Graphs with unique maximum packing of closed neighborhoods.

Dragana Bozovic, Iztok Peterin

Discuss. Math. Graph Theory, 2022

2021

Independent transversal total domination versus total domination in trees.

Abel Cabrera Martínez, Iztok Peterin, Ismael González Yero

Discuss. Math. Graph Theory, 2021

On three outer-independent domination related parameters in graphs.

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero

Discret. Appl. Math., 2021

A note on the packing chromatic number of lexicographic products.

Dragana Bozovic, Iztok Peterin

Discret. Appl. Math., 2021

A Steiner general position problem in graph theory.

Sandi Klavzar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero

Comput. Appl. Math., 2021

2020

(Open) packing number of some graph products.

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero

Discret. Math. Theor. Comput. Sci., 2020

2019

Efficient closed domination in digraph products.

Iztok Peterin, Ismael González Yero

J. Comb. Optim., 2019

A characterization of graphs with disjoint total dominating sets.

Michael A. Henning, Iztok Peterin

Ars Math. Contemp., 2019

2018

A note on the Thue chromatic number of lexicographic produts of graphs.

Erika Fecková Skrabul'áková, Iztok Peterin, Jens Schreyer, Andrej Taranenko

Discuss. Math. Graph Theory, 2018

Bounding the open <i>k</i>-monopoly number of strong product graphs.

Dorota Kuziak, Iztok Peterin, Ismael González Yero

Discuss. Math. Graph Theory, 2018

Cartesian products of directed graphs with loops.

Wilfried Imrich, Iztok Peterin

Discret. Math., 2018

The b-chromatic number and related topics - A survey.

Marko Jakovac, Iztok Peterin

Discret. Appl. Math., 2018

2017

Graphs that are simultaneously efficient open domination and efficient closed domination graphs.

Sandi Klavzar, Iztok Peterin, Ismael González Yero

Discret. Appl. Math., 2017

2016

Partitioning the vertex set of G to make G ☐ H an efficient open domination graph.

Tadeja Kraner Sumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh

Discret. Math. Theor. Comput. Sci., 2016

Open k-monopolies in graphs: complexity and related concepts.

Dorota Kuziak, Iztok Peterin, Ismael González Yero

Discret. Math. Theor. Comput. Sci., 2016

Spectra of graphs and closed distance magic labelings.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Discret. Math., 2016

2015

Hybrid evolutionary algorithm for the b-chromatic number.

Iztok Fister, Iztok Peterin, Marjan Mernik, Matej Crepinsek

J. Heuristics, 2015

Distance Magic Labeling and Two Products of Graphs.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh

Graphs Comb., 2015

Toll convexity.

Liliana Alcón, Bostjan Bresar, Tanja Gologranc, Marisa Gutierrez, Tadeja Kraner Sumenjak, Iztok Peterin, Aleksandra Tepeh

Eur. J. Comb., 2015

The median game.

Manoj Changat, Divya Sindhu Lekha, Iztok Peterin, Ajitha R. Subhamathi, Simon Spacapan

Discret. Optim., 2015

The b-chromatic index of direct product of graphs.

Ivo Koch, Iztok Peterin

Discret. Appl. Math., 2015

Group distance magic labeling of direct product of graphs.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh

Ars Math. Contemp., 2015

2014

Rainbow Connection and Graph Products.

Tanja Gologranc, Gasper Mekis, Iztok Peterin

Graphs Comb., 2014

Efficient open domination in graph products.

Dorota Kuziak, Iztok Peterin, Ismael González Yero

Discret. Math. Theor. Comput. Sci., 2014

Some Steiner concepts on lexicographic products of graphs.

Bijo S. Anand, Manoj Changat, Iztok Peterin, Prasanth G. Narasimha-Shenoi

Discret. Math. Algorithms Appl., 2014

2013

Intervals and Convex Sets in Strong Product of Graphs.

Iztok Peterin

Graphs Comb., 2013

Hamming dimension of a graph - The case of Sierpiński graphs.

Sandi Klavzar, Iztok Peterin, Sara Sabrina Zemljic

Eur. J. Comb., 2013

A forbidden subgraph characterization of some graph classes using betweenness axioms.

Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Geetha Seethakuttyamma, Simon Spacapan

Discret. Math., 2013

Quasi-almostmedian graphs.

Iztok Peterin

Ars Comb., 2013

2012

Convex Sets in Lexicographic Products of Graphs.

Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin

Graphs Comb., 2012

The pre-hull number and lexicographic product.

Iztok Peterin

Discret. Math., 2012

2011

A note on 3-Steiner intervals and betweenness.

Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Aleksandra Tepeh

Discret. Math., 2011

2010

NZ-flows in strong products of graphs.

Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang

J. Graph Theory, 2010

<i>n</i>-ary transit functions in graphs.

Manoj Changat, Joseph Mathews, Prasanth G. Narasimha-Shenoi, Iztok Peterin

Discuss. Math. Graph Theory, 2010

2009

Strongly distance-balanced graphs and graph products.

Kannan Balakrishnan, Manoj Changat, Iztok Peterin, Simon Spacapan, Primoz Sparl, Ajitha R. Subhamathi

Eur. J. Comb., 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

2008

A characterization of planar partial cubes.

Iztok Peterin

Discret. Math., 2008

Game Chromatic Number of Cartesian Product Graphs.

Tomasz Bartnicki, Bostjan Bresar, Jaroslaw Grytczuk, Matjaz Kovse, Zofia Miechowicz, Iztok Peterin

Electron. J. Comb., 2008

Antimedian graphs.

Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan

Australas. J Comb., 2008

2007

Game chromatic number of Cartesian product graphs.

Iztok Peterin

Electron. Notes Discret. Math., 2007

Recognizing Cartesian products in linear time.

Wilfried Imrich, Iztok Peterin

Discret. Math., 2007

Fast recognition of classes of almost-median graphs.

Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert

Discret. Math., 2007

Nonrepetitive colorings of trees.

Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin

Discret. Math., 2007

2006

A charaterization of planar median graphs.

Iztok Peterin

Discuss. Math. Graph Theory, 2006

2005

Characterizing subgraphs of Hamming graphs.

Sandi Klavzar, Iztok Peterin

J. Graph Theory, 2005

2004

Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs.

Iztok Peterin

Order, 2004