Iztok Peterin

From MaRDI portal
Person:279208

Available identifiers

zbMath Open peterin.iztokMaRDI QIDQ279208

List of research outcomes

PublicationDate of PublicationType
A new approach to b-coloring of regular graphs2023-11-22Paper
The Toll Walk Transit Function of a Graph: Axiomatic Characterizations and First-Order Non-definability2023-10-31Paper
The simultaneous fractional dimension of graph families2023-09-29Paper
On some metric properties of direct-co-direct product2023-09-11Paper
Axiomatic characterization of the toll walk function of some graph classes2023-08-17Paper
Distance formula for direct-co-direct product in the case of disconnected factors2023-04-25Paper
On b-acyclic chromatic number of a graph2023-02-20Paper
The total co-independent domination number of some graph operations2022-09-02Paper
Graphs with unique maximum packing of closed neighborhoods2022-07-01Paper
On b-acyclic chromatic number of a graph2022-06-13Paper
Roman domination in direct product graphs and rooted product graphs2022-06-03Paper
Geodesic transversal problem for join and lexicographic product of graphs2022-05-23Paper
Incidence dimension and 2-packing number in graphs2022-02-21Paper
A Steiner general position problem in graph theory2021-11-15Paper
Recognizing generalized Sierpiński graphs2021-05-20Paper
Roman domination in direct product graphs and rooted product graphs2021-05-20Paper
A note on the packing chromatic number of lexicographic products2021-03-25Paper
On three outer-independent domination related parameters in graphs2021-03-17Paper
\([1,k\)-domination number of lexicographic products of graphs]2021-02-16Paper
(Open) packing number of some graph products2021-01-05Paper
Independent transversal total domination versus total domination in trees2020-12-08Paper
Dominating the direct product of two graphs through total Roman strategies2020-05-27Paper
Edge metric dimension of some graph operations2020-04-23Paper
The complexity of open k-monopolies in graphs for negative k2020-04-22Paper
A note on bipartite graphs whose [1,k-domination number equal to their number of vertices]2020-04-22Paper
A characterization of graphs with disjoint total dominating sets2019-07-25Paper
Efficient closed domination in digraph products2019-06-25Paper
Wiener index of strong product of graphs2018-11-09Paper
The security number of lexicographic products2018-09-17Paper
A note on the thue chromatic number of lexicographic products of graphs2018-06-29Paper
The median game2018-05-24Paper
Cartesian products of directed graphs with loops2018-04-05Paper
Bounding the open \(k\)-monopoly number of strong product graphs2018-01-10Paper
The \(b\)-chromatic number and related topics -- a survey2017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45911092017-11-10Paper
Computing the (k-)monopoly number of direct product of graphs2017-07-19Paper
Hybrid evolutionary algorithm for the b-chromatic number2017-04-28Paper
Graphs that are simultaneously efficient open domination and efficient closed domination graphs2017-03-15Paper
On gated sets in graphs2017-03-09Paper
Open k-monopolies in graphs: complexity and related concepts2017-03-03Paper
Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph2017-03-03Paper
Resolvability and strong resolvability in the direct product of graphs2017-02-22Paper
The induced path transit function and the Pasch axiom2016-07-11Paper
https://portal.mardi4nfdi.de/entity/Q28099342016-05-30Paper
Spectra of graphs and closed distance magic labelings2016-04-27Paper
Group distance magic labeling of direct product of graphs2016-01-25Paper
The \(b\)-chromatic index of a graph2015-10-15Paper
Distance magic labeling and two products of graphs2015-09-24Paper
The \(b\)-chromatic index of direct product of graphs2015-07-06Paper
Toll convexity2015-02-18Paper
Some Steiner concepts on lexicographic products of graphs2014-11-28Paper
Resolvability and strong resolvability in the direct product of graphs2014-06-23Paper
Rainbow connection and graph products2014-06-16Paper
Open k-monopolies in graphs: complexity and related concepts2014-05-02Paper
https://portal.mardi4nfdi.de/entity/Q53972102014-02-19Paper
Atoms and clique separators in graph products2013-12-19Paper
Intervals and convex sets in strong product of graphs2013-06-26Paper
A forbidden subgraph characterization of some graph classes using betweenness axioms2013-04-15Paper
Hamming dimension of a graph-the case of Sierpiński graphs2012-12-03Paper
Almost self-centered median and chordal graphs2012-11-09Paper
On the b-chromatic number of some graph products2012-09-17Paper
The pre-hull number and lexicographic product2012-07-04Paper
A note on 3-Steiner intervals and betweenness2012-04-13Paper
Convex sets in lexicographic products of graphs2012-01-24Paper
n-ary transit functions in graphs2011-05-09Paper
NZ-flows in strong products of graphs2010-11-24Paper
Steiner intervals, geodesic intervals, and betweenness2009-12-15Paper
Strongly distance-balanced graphs and graph products2009-06-17Paper
A characterization of planar partial cubes2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q35312952008-10-22Paper
https://portal.mardi4nfdi.de/entity/Q35171662008-08-12Paper
Game chromatic number of Cartesian product graphs2008-06-05Paper
Fast recognition of classes of almost-median graphs2007-02-13Paper
Recognizing Cartesian products in linear time2007-02-13Paper
A charaterization of planar median graphs2006-10-16Paper
Characterizing flag graphs and incuced subgraphs of Cartesian product graphs2005-11-24Paper
Characterizing subgraphs of Hamming graphs2005-08-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Iztok Peterin