Iztok Peterin

According to our database1, Iztok Peterin authored at least 42 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Independent transversal total domination versus total domination in trees.
Discuss. Math. Graph Theory, 2021

2020
(Open) packing number of some graph products.
Discret. Math. Theor. Comput. Sci., 2020

2019
Efficient closed domination in digraph products.
J. Comb. Optim., 2019

A characterization of graphs with disjoint total dominating sets.
Ars Math. Contemp., 2019

2018
A note on the Thue chromatic number of lexicographic produts of graphs.
Discuss. Math. Graph Theory, 2018

Bounding the open <i>k</i>-monopoly number of strong product graphs.
Discuss. Math. Graph Theory, 2018

Cartesian products of directed graphs with loops.
Discret. Math., 2018

The b-chromatic number and related topics - A survey.
Discret. Appl. Math., 2018

2017
Graphs that are simultaneously efficient open domination and efficient closed domination graphs.
Discret. Appl. Math., 2017

2016
Partitioning the vertex set of G to make G ☐ H an efficient open domination graph.
Discret. Math. Theor. Comput. Sci., 2016

Open k-monopolies in graphs: complexity and related concepts.
Discret. Math. Theor. Comput. Sci., 2016

Spectra of graphs and closed distance magic labelings.
Discret. Math., 2016

2015
Hybrid evolutionary algorithm for the b-chromatic number.
J. Heuristics, 2015

Distance Magic Labeling and Two Products of Graphs.
Graphs Comb., 2015

Toll convexity.
Eur. J. Comb., 2015

The median game.
Discret. Optim., 2015

The b-chromatic index of direct product of graphs.
Discret. Appl. Math., 2015

Group distance magic labeling of direct product of graphs.
Ars Math. Contemp., 2015

2014
Rainbow Connection and Graph Products.
Graphs Comb., 2014

Efficient open domination in graph products.
Discret. Math. Theor. Comput. Sci., 2014

Some Steiner concepts on lexicographic products of graphs.
Discret. Math. Algorithms Appl., 2014

2013
Intervals and Convex Sets in Strong Product of Graphs.
Graphs Comb., 2013

Hamming dimension of a graph - The case of Sierpiński graphs.
Eur. J. Comb., 2013

A forbidden subgraph characterization of some graph classes using betweenness axioms.
Discret. Math., 2013

Quasi-almostmedian graphs.
Ars Comb., 2013

2012
Convex Sets in Lexicographic Products of Graphs.
Graphs Comb., 2012

The pre-hull number and lexicographic product.
Discret. Math., 2012

2011
A note on 3-Steiner intervals and betweenness.
Discret. Math., 2011

2010
NZ-flows in strong products of graphs.
J. Graph Theory, 2010

<i>n</i>-ary transit functions in graphs.
Discuss. Math. Graph Theory, 2010

2009
Strongly distance-balanced graphs and graph products.
Eur. J. Comb., 2009

Steiner intervals, geodesic intervals, and betweenness.
Discret. Math., 2009

2008
A characterization of planar partial cubes.
Discret. Math., 2008

Game Chromatic Number of Cartesian Product Graphs.
Electron. J. Comb., 2008

Antimedian graphs.
Australas. J Comb., 2008

2007
Game chromatic number of Cartesian product graphs.
Electron. Notes Discret. Math., 2007

Recognizing Cartesian products in linear time.
Discret. Math., 2007

Fast recognition of classes of almost-median graphs.
Discret. Math., 2007

Nonrepetitive colorings of trees.
Discret. Math., 2007

2006
A charaterization of planar median graphs.
Discuss. Math. Graph Theory, 2006

2005
Characterizing subgraphs of Hamming graphs.
J. Graph Theory, 2005

2004
Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs.
Order, 2004


  Loading...