Iztok Peterin - RankMe

57 papers Journal 56Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The toll walk transit function of a graph: Axiomatic characterizations and first-order non-definability. Discret. Appl. Math. Manoj Changat, Jeny Jacob, Lekshmi Kamal K. Sheela, Iztok Peterin
2025	J	`jnl`	Domination number of modular product graphs. Comput. Appl. Math. Sergio Bermudo, Iztok Peterin, Jelena Sedlar, Riste Skrekovski
2025	J	`jnl`	Grundy packing coloring of graphs. Discret. Appl. Math. Didem Gözüpek, Iztok Peterin
2025	J	`jnl`	On acyclic b-chromatic number of cubic graphs. CoRR Marcin Anholcer, Sylwia Cichacz, Iztok Peterin
2024	J	`jnl`	A new approach to b-coloring of regular graphs. Appl. Math. Comput. Magda Dettlaff, Hanna Furmanczyk, Iztok Peterin, Adriana Roux, Radoslaw Ziemann
2024	J	`jnl`	Resolving vertices of graphs with differences. Comput. Appl. Math. Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero
2023	—	`conf`	Axiomatic Characterization of the Toll Walk Function of Some Graph Classes. CALDAM Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin
2023	J	`jnl`	Distance formula for direct-co-direct product in the case of disconnected factors. Art Discret. Appl. Math. Aleksander Kelenc, Iztok Peterin
2023	J	`jnl`	On b-acyclic chromatic number of a graph. Comput. Appl. Math. Marcin Anholcer, Sylwia Cichacz, Iztok Peterin
2023	J	`jnl`	On some metric properties of direct-co-direct product. Appl. Math. Comput. Aleksander Kelenc, Iztok Peterin
2022	J	`jnl`	Geodesic transversal problem for join and lexicographic product of graphs. Comput. Appl. Math. Iztok Peterin, Gabriel Semanisin
2022	J	`jnl`	Graphs with unique maximum packing of closed neighborhoods. Discuss. Math. Graph Theory Dragana Bozovic, Iztok Peterin
2022	J	`jnl`	Incidence dimension and 2-packing number in graphs. RAIRO Oper. Res. Dragana Bozovic, Aleksander Kelenc, Iztok Peterin, Ismael G. Yero
2021	J	`jnl`	A Steiner general position problem in graph theory. Comput. Appl. Math. Sandi Klavzar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero
2021	J	`jnl`	A note on the packing chromatic number of lexicographic products. Discret. Appl. Math. Dragana Bozovic, Iztok Peterin
2021	J	`jnl`	Independent transversal total domination versus total domination in trees. Discuss. Math. Graph Theory Abel Cabrera Martínez, Iztok Peterin, Ismael González Yero
2021	J	`jnl`	On three outer-independent domination related parameters in graphs. Discret. Appl. Math. Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero
2020	J	`jnl`	(Open) packing number of some graph products. Discret. Math. Theor. Comput. Sci. Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero
2019	J	`jnl`	A characterization of graphs with disjoint total dominating sets. Ars Math. Contemp. Michael A. Henning, Iztok Peterin
2019	J	`jnl`	Efficient closed domination in digraph products. J. Comb. Optim. Iztok Peterin, Ismael González Yero
2018	J	`jnl`	A note on the Thue chromatic number of lexicographic produts of graphs. Discuss. Math. Graph Theory Erika Fecková Skrabul'áková, Iztok Peterin, Jens Schreyer, Andrej Taranenko
2018	J	`jnl`	Bounding the open Discuss. Math. Graph Theory Dorota Kuziak, Iztok Peterin, Ismael González Yero
2018	J	`jnl`	Cartesian products of directed graphs with loops. Discret. Math. Wilfried Imrich, Iztok Peterin
2018	J	`jnl`	The b-chromatic number and related topics - A survey. Discret. Appl. Math. Marko Jakovac, Iztok Peterin
2017	J	`jnl`	Graphs that are simultaneously efficient open domination and efficient closed domination graphs. Discret. Appl. Math. Sandi Klavzar, Iztok Peterin, Ismael González Yero
2016	J	`jnl`	Open k-monopolies in graphs: complexity and related concepts. Discret. Math. Theor. Comput. Sci. Dorota Kuziak, Iztok Peterin, Ismael González Yero
2016	J	`jnl`	Partitioning the vertex set of G to make G ☐ H an efficient open domination graph. Discret. Math. Theor. Comput. Sci. Tadeja Kraner Sumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh
2016	J	`jnl`	Spectra of graphs and closed distance magic labelings. Discret. Math. Marcin Anholcer, Sylwia Cichacz, Iztok Peterin
2015	J	`jnl`	Distance Magic Labeling and Two Products of Graphs. Graphs Comb. Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh
2015	J	`jnl`	Group distance magic labeling of direct product of graphs. Ars Math. Contemp. Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh
2015	J	`jnl`	Hybrid evolutionary algorithm for the b-chromatic number. J. Heuristics Iztok Fister, Iztok Peterin, Marjan Mernik, Matej Crepinsek
2015	J	`jnl`	The b-chromatic index of direct product of graphs. Discret. Appl. Math. Ivo Koch, Iztok Peterin
2015	J	`jnl`	The median game. Discret. Optim. Manoj Changat, Divya Sindhu Lekha, Iztok Peterin, Ajitha R. Subhamathi, Simon Spacapan
2015	J	`jnl`	Toll convexity. Eur. J. Comb. Liliana Alcón, Bostjan Bresar, Tanja Gologranc, Marisa Gutierrez, Tadeja Kraner Sumenjak, Iztok Peterin, Aleksandra Tepeh
2014	J	`jnl`	Efficient open domination in graph products. Discret. Math. Theor. Comput. Sci. Dorota Kuziak, Iztok Peterin, Ismael González Yero
2014	J	`jnl`	Rainbow Connection and Graph Products. Graphs Comb. Tanja Gologranc, Gasper Mekis, Iztok Peterin
2014	J	`jnl`	Some Steiner concepts on lexicographic products of graphs. Discret. Math. Algorithms Appl. Bijo S. Anand, Manoj Changat, Iztok Peterin, Prasanth G. Narasimha-Shenoi
2013	J	`jnl`	A forbidden subgraph characterization of some graph classes using betweenness axioms. Discret. Math. Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Geetha Seethakuttyamma, Simon Spacapan
2013	J	`jnl`	Hamming dimension of a graph - The case of Sierpiński graphs. Eur. J. Comb. Sandi Klavzar, Iztok Peterin, Sara Sabrina Zemljic
2013	J	`jnl`	Intervals and Convex Sets in Strong Product of Graphs. Graphs Comb. Iztok Peterin
2013	J	`jnl`	Quasi-almostmedian graphs. Ars Comb. Iztok Peterin
2012	J	`jnl`	Convex Sets in Lexicographic Products of Graphs. Graphs Comb. Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin
2012	J	`jnl`	The pre-hull number and lexicographic product. Discret. Math. Iztok Peterin
2011	J	`jnl`	A note on 3-Steiner intervals and betweenness. Discret. Math. Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Aleksandra Tepeh
2010	J	`jnl`	NZ-flows in strong products of graphs. J. Graph Theory Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang
2009	J	`jnl`	Steiner intervals, geodesic intervals, and betweenness. Discret. Math. Bostjan Bresar, Manoj Changat, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Aleksandra Tepeh Horvat
2009	J	`jnl`	Strongly distance-balanced graphs and graph products. Eur. J. Comb. Kannan Balakrishnan, Manoj Changat, Iztok Peterin, Simon Spacapan, Primoz Sparl, Ajitha R. Subhamathi
2008	J	`jnl`	A characterization of planar partial cubes. Discret. Math. Iztok Peterin
2008	J	`jnl`	Antimedian graphs. Australas. J Comb. Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan
2008	J	`jnl`	Game Chromatic Number of Cartesian Product Graphs. Electron. J. Comb. Tomasz Bartnicki, Bostjan Bresar, Jaroslaw Grytczuk, Matjaz Kovse, Zofia Miechowicz, Iztok Peterin
2007	J	`jnl`	Fast recognition of classes of almost-median graphs. Discret. Math. Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert
2007	J	`jnl`	Game chromatic number of Cartesian product graphs. Electron. Notes Discret. Math. Iztok Peterin
2007	J	`jnl`	Nonrepetitive colorings of trees. Discret. Math. Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin
2007	J	`jnl`	Recognizing Cartesian products in linear time. Discret. Math. Wilfried Imrich, Iztok Peterin
2006	J	`jnl`	A charaterization of planar median graphs. Discuss. Math. Graph Theory Iztok Peterin
2005	J	`jnl`	Characterizing subgraphs of Hamming graphs. J. Graph Theory Sandi Klavzar, Iztok Peterin
2004	J	`jnl`	Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs. Order Iztok Peterin