research
∙
02/28/2023
Improved bounds on the cop number when forbidding a minor
Andreae (1986) proved that the cop number of connected H-minor-free grap...
share
research
∙
08/11/2021
Linear Bounds for Cycle-free Saturation Games
Given a family of graphs ℱ, we define the ℱ-saturation game as follows. ...
research
∙
04/08/2021
Eternal k-domination on graphs
Eternal domination is a dynamic process by which a graph is protected fr...
research
∙
03/29/2021
Hybrid Power-Law Models of Network Traffic
The availability of large scale streaming network data has reinforced th...
research
∙
02/20/2020
Iterated Global Models for Complex Networks
We introduce the Iterated Global model as a deterministic graph process ...
research
∙
03/11/2019
