| Publication | Date of Publication | Type |
|---|
The strong vertex span of trees
Communications on Applied Mathematics and Computation | 2026-06-16 | Paper |
Patrolling cop vs omniscient robber
(available as arXiv preprint) | 2026-01-01 | Paper |
Span capacities of graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Results on Cartesian 1-capacity of graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Maker-Breaker Sabotage Game
(available as arXiv preprint) | 2026-01-01 | Paper |
Graphs with span 1 and shortest optimal walks
Applied Mathematics and Computation | 2025-07-24 | Paper |
Daisy Hamming graphs
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
The radius capture number
(available as arXiv preprint) | 2025-01-01 | Paper |
Span of a Graph: Keeping the Safety Distance
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
Graphs with span 1 and shortest optimal walks
(available as arXiv preprint) | 2024-01-01 | Paper |
The strong vertex span of trees
(available as arXiv preprint) | 2024-01-01 | Paper |
| Irregularity of expansions and Pell graphs | 2021-03-15 | Paper |
WITHDRAWN: Irregularity of expansions and Pell graphs
(available as arXiv preprint) | 2021-01-01 | Paper |
| Daisy Hamming graphs | 2020-05-27 | Paper |
Daisy cubes: a characterization and a generalization
European Journal of Combinatorics | 2020-02-20 | Paper |
Mixed metric dimension of graphs
Applied Mathematics and Computation | 2019-04-29 | Paper |
On graphs with the maximum edge metric dimension
Discrete Applied Mathematics | 2019-03-11 | Paper |
A note on the thue chromatic number of lexicographic products of graphs
Discussiones Mathematicae Graph Theory | 2018-06-29 | Paper |
| On the Hausdorff distance between some families of chemical graphs | 2017-07-19 | Paper |
Measuring closeness of graphs -- the Hausdorff distance
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2017-01-31 | Paper |
| scientific article; zbMATH DE number 6478971 (Why is no real title available?) | 2015-09-07 | Paper |
The partition dimension of strong product graphs and Cartesian product graphs
Discrete Mathematics | 2014-08-08 | Paper |
On the vertex \(k\)-path cover
Discrete Applied Mathematics | 2014-04-22 | Paper |
| A new characterization and a recognition algorithm of Lucas cubes | 2014-02-14 | Paper |
Resonant sets of benzenoid graphs and hypercubes of their resonance graphs
MATCH - Communications in Mathematical and in Computer Chemistry | 2013-10-30 | Paper |
On the k-path vertex cover of some graph products
Discrete Mathematics | 2012-11-22 | Paper |
1-factors and characterization of reducible faces of plane elementary bipartite graphs
Discussiones Mathematicae Graph Theory | 2012-11-08 | Paper |
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
Computers & Mathematics with Applications | 2010-06-28 | Paper |
| On elementary benzenoid graphs: new characterization and structure of their resonance graphs | 2009-12-03 | Paper |
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
Discrete Applied Mathematics | 2008-09-10 | Paper |
Fast recognition of Fibonacci cubes
Algorithmica | 2007-11-28 | Paper |
An elitist genetic algorithm for the maximum independent set problem.
Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001. | 2002-01-30 | Paper |
