research
∙
07/18/2023
Algorithms and hardness for Metric Dimension on digraphs
In the Metric Dimension problem, one asks for a minimum-size set R of ve...
share
research
∙
03/22/2022
The neighbour sum distinguishing edge-weighting with local constraints
A k-edge-weighting of G is a mapping ω:E(G)⟶{1,…,k}. The edge-weighting ...
research
∙
03/10/2020
On the balanceability of some graph classes
Given a graph G, a 2-coloring of the edges of K_n is said to contain a b...
research
∙
12/20/2018
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
A graph is diameter-2-critical if its diameter is 2 but the removal of a...
research
∙
07/27/2018
Connected Subtraction Games on Subdivided Stars
The present paper deals with connected subtraction games in graphs, whic...
research
∙
03/07/2018
Partition games are pure breaking games
Taking-and-breaking games are combinatorial games played on heaps of tok...
research
∙
09/15/2017