2024
Packings in bipartite prisms and hypercubes.
Discret. Math., April, 2024
Lower (total) mutual-visibility number in graphs.
Appl. Math. Comput., March, 2024
Edge open packing: complexity, algorithmic aspects, and bounds.
CoRR, 2024
2023
Computation of Grundy dominating sequences in (co-)bipartite graphs.
Comput. Appl. Math., December, 2023
Geodesic packing in graphs.
Appl. Math. Comput., December, 2023
Uniquely colorable graphs up to automorphisms.
Appl. Math. Comput., August, 2023
On the chromatic edge stability index of graphs.
Eur. J. Comb., June, 2023
Injective coloring of graphs revisited.
Discret. Math., May, 2023
Graphs with equal Grundy domination and independence number.
Discret. Optim., May, 2023
The geodesic transversal problem on some networks.
Comput. Appl. Math., February, 2023
Orientable domination in product-like graphs.
Discret. Appl. Math., 2023
2022
Domination in digraphs and their direct and Cartesian products.
J. Graph Theory, 2022
Graphs that are critical for the packing chromatic number.
Discuss. Math. Graph Theory, 2022
Graphs with a unique maximum independent set up to automorphisms.
Discret. Appl. Math., 2022
The geodesic-transversal problem.
Appl. Math. Comput., 2022
2021
A new framework to approach Vizing's conjecture.
Discuss. Math. Graph Theory, 2021
On Grundy total domination number in product graphs.
Discuss. Math. Graph Theory, 2021
Indicated coloring game on Cartesian products of graphs.
Discret. Appl. Math., 2021
S-packing colorings of distance graphs G(Z, {2, t}).
Discret. Appl. Math., 2021
Graphs with unique zero forcing sets and Grundy dominating sets.
CoRR, 2021
2020
A survey on packing colorings.
Discuss. Math. Graph Theory, 2020
Critical graphs for the chromatic edge-stability number.
Discret. Math., 2020
On the P3-hull number of Hamming graphs.
Discret. Appl. Math., 2020
A 34-approximation of Vizing's conjecture for claw-free graphs.
Discret. Appl. Math., 2020
2019
Exact Distance Graphs of Product Graphs.
Graphs Comb., 2019
Independence number of products of Kneser graphs.
Discret. Math., 2019
Grundy domination and zero forcing in Kneser graphs.
Ars Math. Contemp., 2019
Hitting subgraphs in <i>P</i><sub>4</sub>-tidy graphs.
Appl. Math. Comput., 2019
2018
Convex and isometric domination of (weak) dominating pair graphs.
Theor. Comput. Sci., 2018
On total domination in the Cartesian product of graphs.
Discuss. Math. Graph Theory, 2018
An infinite family of subcubic graphs with unbounded packing chromatic number.
Discret. Math., 2018
Total dominating sequences in trees, split graphs, and under modular decomposition.
Discret. Optim., 2018
On the number of maximal independent sets in minimum colorings of split graphs.
Discret. Appl. Math., 2018
1-perfectly orientable K4-minor-free and outerplanar graphs.
Discret. Appl. Math., 2018
Domination parameters with number : Interrelations and algorithmic consequences.
Discret. Appl. Math., 2018
Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor.
Art Discret. Appl. Math., 2018
2017
The game total domination problem is log-complete in PSPACE.
Inf. Process. Lett., 2017
How long can one bluff in the domination game?.
Discuss. Math. Graph Theory, 2017
Packing chromatic number under local changes in a graph.
Discret. Math., 2017
Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs.
Discret. Math., 2017
Grundy dominating sequences and zero forcing sets.
Discret. Optim., 2017
Preface: Algorithmic Graph Theory on the Adriatic Coast.
Discret. Appl. Math., 2017
Uniformly dissociated graphs.
Ars Math. Contemp., 2017
2016
Complexity of the game domination problem.
Theor. Comput. Sci., 2016
Packing Chromatic Number of Base-3 Sierpiński Graphs.
Graphs Comb., 2016
1-perfectly orientable K<sub>4</sub>-minor-free and outerplanar graphs.
Electron. Notes Discret. Math., 2016
Total dominating sequences in graphs.
Discret. Math., 2016
Dominating Sequences in Grid-Like and Toroidal Graphs.
Electron. J. Comb., 2016
2015
Cographs Which are Cover-Incomparability Graphs of Posets.
Order, 2015
On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway.
Graphs Comb., 2015
Guarded subgraphs and the domination game.
Discret. Math. Theor. Comput. Sci., 2015
Vizing's Conjecture for Graphs with Domination Number 3 - a New Proof.
Electron. J. Comb., 2015
2014
Dominating sequences in graphs.
Discret. Math., 2014
Domination game: Effect of edge- and vertex-removal.
Discret. Math., 2014
Equal opportunity networks, distance-balanced graphs, and Wiener game.
Discret. Optim., 2014
On the weighted k-path vertex cover problem.
Discret. Appl. Math., 2014
The hypergraph of θ-classes and θ-graphs of partial cubes.
Ars Comb., 2014
2013
Retracts of Products of Chordal Graphs.
J. Graph Theory, 2013
Domination game played on trees and spanning subgraphs.
Discret. Math., 2013
Domination game: Extremal families of graphs for 3/53/5-conjectures.
Discret. Appl. Math., 2013
On the vertex <i>k</i>k-path cover.
Discret. Appl. Math., 2013
2012
Vizing's conjecture: a survey and recent results.
J. Graph Theory, 2012
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks.
Discret. Appl. Math., 2012
2011
On a local 3-Steiner convexity.
Eur. J. Comb., 2011
The geodetic number of the lexicographic product of graphs.
Discret. Math., 2011
Minimum k-path vertex cover.
Discret. Appl. Math., 2011
Proceedings of the Structural Analysis of Complex Networks, 2011
2010
Domination Game and an Imagination Strategy.
SIAM J. Discret. Math., 2010
Simultaneous embeddings of graphs as median and antimedian subgraphs.
Networks, 2010
The periphery graph of a median graph.
Discuss. Math. Graph Theory, 2010
Cover-incomparability graphs and chordal graphs.
Discret. Appl. Math., 2010
Computing median and antimedian sets in median graphs.
Algorithmica, 2010
2009
Fair reception and Vizing's conjecture.
J. Graph Theory, 2009
Cage-amalgamation graphs, a common generalization of chordal and median graphs.
Eur. J. Comb., 2009
Cube intersection concepts in median graphs.
Discret. Math., 2009
Steiner intervals, geodesic intervals, and betweenness.
Discret. Math., 2009
On the remoteness function in median graphs.
Discret. Appl. Math., 2009
Characterizing posets for which their natural transit functions coincide.
Ars Math. Contemp., 2009
θ-graphs of partial cubes and strong edge colorings.
Ars Comb., 2009
Broadcast domination of products of graphs.
Ars Comb., 2009
2008
Cover-Incomparability Graphs of Posets.
Order, 2008
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs.
Electron. Notes Discret. Math., 2008
On the geodetic number and related metric sets in Cartesian product graphs.
Discret. Math., 2008
On the geodetic number of median graphs.
Discret. Math., 2008
Crossing graphs of fiber-complemented graphs.
Discret. Math., 2008
Game Chromatic Number of Cartesian Product Graphs.
Electron. J. Comb., 2008
On the connectivity of the direct product of graphs.
Australas. J Comb., 2008
2007
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs.
SIAM J. Discret. Math., 2007
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees.
Electron. Notes Discret. Math., 2007
Hamming polynomials and their partial derivatives.
Eur. J. Comb., 2007
Characterizing almost-median graphs.
Eur. J. Comb., 2007
Edge-connectivity of strong products of graphs.
Discuss. Math. Graph Theory, 2007
On cube-free median graphs.
Discret. Math., 2007
Dominating direct products of graphs.
Discret. Math., 2007
Maximal proper subgraphs of median graphs.
Discret. Math., 2007
Nonrepetitive colorings of trees.
Discret. Math., 2007
On the 2-rainbow domination in graphs.
Discret. Appl. Math., 2007
2006
Roots of cube polynomials of median graphs.
J. Graph Theory, 2006
<i>Theta</i>-graceful labelings of partial cubes.
Discret. Math., 2006
2005
Hypercubes As Direct Products.
SIAM J. Discret. Math., 2005
Paired-domination of Cartesian products of graphs and rainbow domination.
Electron. Notes Discret. Math., 2005
Median and quasi-median direct products of graphs.
Discuss. Math. Graph Theory, 2005
Reconstructing subgraph-counting graph polynomials of increasing families of graphs.
Discret. Math., 2005
Vizing-like Conjecture for the Upper Domination of Cartesian Products of Graphs - The Proof.
Electron. J. Comb., 2005
2004
Cubic inflation, mirror graphs, regular maps, and partial cubes.
Eur. J. Comb., 2004
Square-free colorings of graphs.
Ars Comb., 2004
2003
Quasi-median graphs, their generalizations, and tree-like equalities.
Eur. J. Comb., 2003
Intersection graphs of maximal hypercubes.
Eur. J. Comb., 2003
Tree-like isometric subgraphs of hypercubes.
Discuss. Math. Graph Theory, 2003
Arboreal structure and regular graphs of median-like classes.
Discuss. Math. Graph Theory, 2003
On the independence graph of a graph.
Discret. Math., 2003
Fast recognition algorithms for classes of partial cubes.
Discret. Appl. Math., 2003
The Cube Polynomial and its Derivatives: the Case of Median Graphs.
Electron. J. Comb., 2003
2002
On the Natural Imprint Function of a Graph.
Eur. J. Comb., 2002
The direct expansion of graphs.
Discret. Math., 2002
2001
Cubes polynomial and its derivatives.
Electron. Notes Discret. Math., 2001
Discuss. Math. Graph Theory, 2001
Partial Hamming graphs and expansion procedures.
Discret. Math., 2001
2000
On subgraphs of Cartesian product graphs and S-primeness.
Electron. Notes Discret. Math., 2000
1999
