default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIztok Peterin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j54]Sergio Bermudo, Iztok Peterin, Jelena Sedlar
, Riste Skrekovski:
Domination number of modular product graphs. Comput. Appl. Math. 44(1): 65 (2025)- 2024
- [j53]Magda Dettlaff, Hanna Furmanczyk, Iztok Peterin, Adriana Roux, Radoslaw Ziemann:
A new approach to b-coloring of regular graphs. Appl. Math. Comput. 481: 128914 (2024) - [j52]Iztok Peterin, Jelena Sedlar, Riste Skrekovski, Ismael G. Yero:
Resolving vertices of graphs with differences. Comput. Appl. Math. 43(5): 275 (2024) - 2023
- [j51]Aleksander Kelenc, Iztok Peterin:
Distance formula for direct-co-direct product in the case of disconnected factors. Art Discret. Appl. Math. 6(2): 2 (2023) - [j50]Aleksander Kelenc, Iztok Peterin:
On some metric properties of direct-co-direct product. Appl. Math. Comput. 457: 128152 (2023) - [j49]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin:
On b-acyclic chromatic number of a graph. Comput. Appl. Math. 42(1) (2023) - [c1]Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin:
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes. CALDAM 2023: 427-446 - 2022
- [j48]Iztok Peterin, Gabriel Semanisin:
Geodesic transversal problem for join and lexicographic product of graphs. Comput. Appl. Math. 41(4) (2022) - [j47]Dragana Bozovic, Iztok Peterin:
Graphs with unique maximum packing of closed neighborhoods. Discuss. Math. Graph Theory 42(3): 779-797 (2022) - [j46]Dragana Bozovic, Aleksander Kelenc, Iztok Peterin, Ismael G. Yero:
Incidence dimension and 2-packing number in graphs. RAIRO Oper. Res. 56(1): 199-211 (2022) - 2021
- [j45]Sandi Klavzar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero:
A Steiner general position problem in graph theory. Comput. Appl. Math. 40(6) (2021) - [j44]Dragana Bozovic, Iztok Peterin:
A note on the packing chromatic number of lexicographic products. Discret. Appl. Math. 293: 34-37 (2021) - [j43]Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero:
On three outer-independent domination related parameters in graphs. Discret. Appl. Math. 294: 115-124 (2021) - [j42]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): 213-224 (2021) - 2020
- [j41]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)
2010 – 2019
- 2019
- [j40]Michael A. Henning, Iztok Peterin:
A characterization of graphs with disjoint total dominating sets. Ars Math. Contemp. 16(2): 359-375 (2019) - [j39]Iztok Peterin, Ismael González Yero:
Efficient closed domination in digraph products. J. Comb. Optim. 38(1): 130-149 (2019) - 2018
- [j38]Marko Jakovac, Iztok Peterin:
The b-chromatic number and related topics - A survey. Discret. Appl. Math. 235: 184-201 (2018) - [j37]Wilfried Imrich, Iztok Peterin:
Cartesian products of directed graphs with loops. Discret. Math. 341(5): 1336-1343 (2018) - [j36]Dorota Kuziak, Iztok Peterin, Ismael González Yero:
Bounding the open k-monopoly number of strong product graphs. Discuss. Math. Graph Theory 38(1): 287-299 (2018) - [j35]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): 635-643 (2018) - 2017
- [j34]Sandi Klavzar, Iztok Peterin, Ismael González Yero:
Graphs that are simultaneously efficient open domination and efficient closed domination graphs. Discret. Appl. Math. 217: 613-621 (2017) - 2016
- [j33]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin:
Spectra of graphs and closed distance magic labelings. Discret. Math. 339(7): 1915-1923 (2016) - [j32]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) - [j31]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) - 2015
- [j30]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh:
Group distance magic labeling of direct product of graphs. Ars Math. Contemp. 9(1): 93-107 (2015) - [j29]Ivo Koch, Iztok Peterin:
The b-chromatic index of direct product of graphs. Discret. Appl. Math. 190-191: 109-117 (2015) - [j28]Manoj Changat, Divya Sindhu Lekha, Iztok Peterin, Ajitha R. Subhamathi, Simon Spacapan:
The median game. Discret. Optim. 17: 80-88 (2015) - [j27]Liliana Alcón, Bostjan Bresar, Tanja Gologranc, Marisa Gutierrez, Tadeja Kraner Sumenjak, Iztok Peterin, Aleksandra Tepeh:
Toll convexity. Eur. J. Comb. 46: 161-175 (2015) - [j26]Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh:
Distance Magic Labeling and Two Products of Graphs. Graphs Comb. 31(5): 1125-1136 (2015) - [j25]Iztok Fister, Iztok Peterin, Marjan Mernik, Matej Crepinsek:
Hybrid evolutionary algorithm for the b-chromatic number. J. Heuristics 21(4): 501-521 (2015) - 2014
- [j24]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) - [j23]Dorota Kuziak, Iztok Peterin, Ismael González Yero:
Efficient open domination in graph products. Discret. Math. Theor. Comput. Sci. 16(1): 105-120 (2014) - [j22]Tanja Gologranc, Gasper Mekis, Iztok Peterin:
Rainbow Connection and Graph Products. Graphs Comb. 30(3): 591-607 (2014) - 2013
- [j21]Iztok Peterin:
Quasi-almostmedian graphs. Ars Comb. 108: 105-115 (2013) - [j20]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): 951-958 (2013) - [j19]Sandi Klavzar, Iztok Peterin, Sara Sabrina Zemljic:
Hamming dimension of a graph - The case of Sierpiński graphs. Eur. J. Comb. 34(2): 460-473 (2013) - [j18]Iztok Peterin:
Intervals and Convex Sets in Strong Product of Graphs. Graphs Comb. 29(3): 705-714 (2013) - 2012
- [j17]Iztok Peterin:
The pre-hull number and lexicographic product. Discret. Math. 312(14): 2153-2157 (2012) - [j16]Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin:
Convex Sets in Lexicographic Products of Graphs. Graphs Comb. 28(1): 77-84 (2012) - 2011
- [j15]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): 2601-2609 (2011) - 2010
- [j14]Manoj Changat, Joseph Mathews, Prasanth G. Narasimha-Shenoi, Iztok Peterin:
n-ary transit functions in graphs. Discuss. Math. Graph Theory 30(4): 671-685 (2010) - [j13]Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cun-Quan Zhang:
NZ-flows in strong products of graphs. J. Graph Theory 64(4): 267-276 (2010)
2000 – 2009
- 2009
- [j12]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): 6114-6125 (2009) - [j11]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): 1048-1053 (2009) - 2008
- [j10]Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan:
Antimedian graphs. Australas. J Comb. 41: 159-170 (2008) - [j9]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) - [j8]Iztok Peterin:
A characterization of planar partial cubes. Discret. Math. 308(24): 6596-6600 (2008) - 2007
- [j7]Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin:
Nonrepetitive colorings of trees. Discret. Math. 307(2): 163-172 (2007) - [j6]Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert:
Fast recognition of classes of almost-median graphs. Discret. Math. 307(3-5): 464-471 (2007) - [j5]Wilfried Imrich, Iztok Peterin:
Recognizing Cartesian products in linear time. Discret. Math. 307(3-5): 472-483 (2007) - [j4]Iztok Peterin:
Game chromatic number of Cartesian product graphs. Electron. Notes Discret. Math. 29: 353-357 (2007) - 2006
- [j3]Iztok Peterin:
A charaterization of planar median graphs. Discuss. Math. Graph Theory 26(1): 41-48 (2006) - 2005
- [j2]Sandi Klavzar, Iztok Peterin:
Characterizing subgraphs of Hamming graphs. J. Graph Theory 49(4): 302-312 (2005) - 2004
- [j1]Iztok Peterin:
Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs. Order 21(4): 283-292 (2004)
Coauthor Index
aka: Ismael G. Yero
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
