| Publication | Date of Publication | Type |
|---|
Independent mutual-visibility coloring and related concepts
Aequationes Mathematicae | 2026-05-08 | Paper |
On the stress transit function
Bulletin of the Iranian Mathematical Society | 2026-04-30 | Paper |
The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
Discrete Applied Mathematics | 2025-12-16 | Paper |
Convex geometries yielded by transit functions
Opuscula Mathematica | 2025-08-09 | Paper |
On the simultaneous metric dimension of a graph and its complement
Rocky Mountain Journal of Mathematics | 2025-05-30 | Paper |
Grundy packing coloring of graphs
Discrete Applied Mathematics | 2025-05-19 | Paper |
A new approach to b-coloring of regular graphs
Applied Mathematics and Computation | 2025-04-24 | Paper |
On distance and strong metric dimension of the modular product
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2025-01-10 | Paper |
Domination number of modular product graphs
Computational and Applied Mathematics | 2025-01-09 | Paper |
Resolving vertices of graphs with differences
Computational and Applied Mathematics | 2024-07-08 | Paper |
| A new approach to b-coloring of regular graphs | 2023-11-22 | Paper |
| The Toll Walk Transit Function of a Graph: Axiomatic Characterizations and First-Order Non-definability | 2023-10-31 | Paper |
The simultaneous fractional dimension of graph families
Acta Mathematica Sinica, English Series | 2023-09-29 | Paper |
On some metric properties of direct-co-direct product
Applied Mathematics and Computation | 2023-09-11 | Paper |
Axiomatic characterization of the toll walk function of some graph classes
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Distance formula for direct-co-direct product in the case of disconnected factors
The Art of Discrete and Applied Mathematics | 2023-04-25 | Paper |
On b-acyclic chromatic number of a graph
Computational and Applied Mathematics | 2023-02-20 | Paper |
The total co-independent domination number of some graph operations
Revista de la Unión Matemática Argentina | 2022-09-02 | Paper |
Graphs with unique maximum packing of closed neighborhoods
Discussiones Mathematicae Graph Theory | 2022-07-01 | Paper |
On b-acyclic chromatic number of a graph
(available as arXiv preprint) | 2022-06-13 | Paper |
Roman domination in direct product graphs and rooted product graphs
AIMS Mathematics | 2022-06-03 | Paper |
Geodesic transversal problem for join and lexicographic product of graphs
Computational and Applied Mathematics | 2022-05-23 | Paper |
Incidence dimension and 2-packing number in graphs
RAIRO - Operations Research | 2022-02-21 | Paper |
A Steiner general position problem in graph theory
Computational and Applied Mathematics | 2021-11-15 | Paper |
Roman domination in direct product graphs and rooted product graphs
(available as arXiv preprint) | 2021-05-20 | Paper |
Recognizing generalized Sierpiński graphs
Applicable Analysis and Discrete Mathematics | 2021-05-20 | Paper |
A note on the packing chromatic number of lexicographic products
Discrete Applied Mathematics | 2021-03-25 | Paper |
On three outer-independent domination related parameters in graphs
Discrete Applied Mathematics | 2021-03-17 | Paper |
\([1,k]\)-domination number of lexicographic products of graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2021-02-16 | Paper |
(Open) packing number of some graph products
(available as arXiv preprint) | 2021-01-05 | Paper |
| (Open) packing number of some graph products | 2021-01-05 | Paper |
Independent transversal total domination versus total domination in trees
Discussiones Mathematicae Graph Theory | 2020-12-08 | Paper |
| Dominating the direct product of two graphs through total Roman strategies | 2020-05-27 | Paper |
Edge metric dimension of some graph operations
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2020-04-23 | Paper |
The complexity of open \(k\)-monopolies in graphs for negative \(k\)
Opuscula Mathematica | 2020-04-22 | Paper |
A note on bipartite graphs whose \([1,k]\)-domination number equal to their number of vertices
Opuscula Mathematica | 2020-04-22 | Paper |
A characterization of graphs with disjoint total dominating sets
Ars Mathematica Contemporanea | 2019-07-25 | Paper |
Efficient closed domination in digraph products
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Wiener index of strong product of graphs
Opuscula Mathematica | 2018-11-09 | Paper |
The security number of lexicographic products
Quaestiones Mathematicae | 2018-09-17 | Paper |
A note on the thue chromatic number of lexicographic products of graphs
Discussiones Mathematicae Graph Theory | 2018-06-29 | Paper |
The median game
Discrete Optimization | 2018-05-24 | Paper |
Cartesian products of directed graphs with loops
Discrete Mathematics | 2018-04-05 | Paper |
Bounding the open \(k\)-monopoly number of strong product graphs
Discussiones Mathematicae Graph Theory | 2018-01-10 | Paper |
The b-chromatic number and related topics -- a survey
Discrete Applied Mathematics | 2017-12-06 | Paper |
| On the monopolies of lexicographic product graphs: bounds and closed formulas | 2017-11-10 | Paper |
Computing the (k-)monopoly number of direct product of graphs
Filomat | 2017-07-19 | Paper |
Hybrid evolutionary algorithm for the b-chromatic number
Journal of Heuristics | 2017-04-28 | Paper |
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
Discrete Applied Mathematics | 2017-03-15 | Paper |
On gated sets in graphs
Taiwanese Journal of Mathematics | 2017-03-09 | Paper |
Partitioning the vertex set of G to make G H an efficient open domination graph
(available as arXiv preprint) | 2017-03-03 | Paper |
| Partitioning the vertex set of G to make G H an efficient open domination graph | 2017-03-03 | Paper |
Open k-monopolies in graphs: complexity and related concepts
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2017-03-03 | Paper |
Resolvability and strong resolvability in the direct product of graphs
Results in Mathematics | 2017-02-22 | Paper |
The induced path transit function and the Pasch axiom
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2016-07-11 | Paper |
Pre-hull number of Cartesian and strong graph products
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-05-30 | Paper |
Spectra of graphs and closed distance magic labelings
Discrete Mathematics | 2016-04-27 | Paper |
Group distance magic labeling of direct product of graphs
Ars Mathematica Contemporanea | 2016-01-25 | Paper |
The \(b\)-chromatic index of a graph
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2015-10-15 | Paper |
Distance magic labeling and two products of graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
The \(b\)-chromatic index of direct product of graphs
Discrete Applied Mathematics | 2015-07-06 | Paper |
Toll convexity
European Journal of Combinatorics | 2015-02-18 | Paper |
Some Steiner concepts on lexicographic products of graphs
Discrete Mathematics, Algorithms and Applications | 2014-11-28 | Paper |
Erratum to ``Total domination number of Cartesian products''
Mathematical Communications | 2014-06-23 | Paper |
Rainbow connection and graph products
Graphs and Combinatorics | 2014-06-16 | Paper |
Efficient open domination in graph products
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-05-02 | Paper |
| Quasi-almostmedian graphs | 2014-02-19 | Paper |
Atoms and clique separators in graph products
Applicable Analysis and Discrete Mathematics | 2013-12-19 | Paper |
Intervals and convex sets in strong product of graphs
Graphs and Combinatorics | 2013-06-26 | Paper |
A forbidden subgraph characterization of some graph classes using betweenness axioms
Discrete Mathematics | 2013-04-15 | Paper |
Hamming dimension of a graph-the case of Sierpiński graphs
European Journal of Combinatorics | 2012-12-03 | Paper |
Almost self-centered median and chordal graphs
Taiwanese Journal of Mathematics | 2012-11-09 | Paper |
On the b-chromatic number of some graph products
Studia Scientiarum Mathematicarum Hungarica | 2012-09-17 | Paper |
The pre-hull number and lexicographic product
Discrete Mathematics | 2012-07-04 | Paper |
A note on 3-Steiner intervals and betweenness
Discrete Mathematics | 2012-04-13 | Paper |
Convex sets in lexicographic products of graphs
Graphs and Combinatorics | 2012-01-24 | Paper |
n-ary transit functions in graphs
Discussiones Mathematicae Graph Theory | 2011-05-09 | Paper |
NZ-flows in strong products of graphs
Journal of Graph Theory | 2010-11-24 | Paper |
Steiner intervals, geodesic intervals, and betweenness
Discrete Mathematics | 2009-12-15 | Paper |
Strongly distance-balanced graphs and graph products
European Journal of Combinatorics | 2009-06-17 | Paper |
A characterization of planar partial cubes
Discrete Mathematics | 2009-01-28 | Paper |
| Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle | 2008-10-22 | Paper |
| Antimedian graphs | 2008-08-12 | Paper |
Game chromatic number of Cartesian product graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Recognizing Cartesian products in linear time
Discrete Mathematics | 2007-02-13 | Paper |
Fast recognition of classes of almost-median graphs
Discrete Mathematics | 2007-02-13 | Paper |
A charaterization of planar median graphs
Discussiones Mathematicae Graph Theory | 2006-10-16 | Paper |
Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
Order | 2005-11-24 | Paper |
Characterizing subgraphs of Hamming graphs
Journal of Graph Theory | 2005-08-29 | Paper |
On Distance and Strong Metric Dimension of the Modular Product
(available as arXiv preprint) | N/A | Paper |
Domination number of modular product graphs
(available as arXiv preprint) | N/A | Paper |
