research
∙
04/24/2021
Robust Connectivity of Graphs on Surfaces
Let Λ(T) denote the set of leaves in a tree T. One natural problem is to...
share
research
∙
06/29/2020
Flexible List Colorings in Graphs with Special Degeneracy Conditions
For a given ε > 0, we say that a graph G is ϵ-flexibly k-choosable if th...
research
∙
05/21/2020
On the cop number of graphs of high girth
We establish a lower bound for the cop number of graphs of high girth in...
research
∙
12/15/2018
