The maximum number of edges in a graph with matching number m and maximu...
k-defensive domination, a variant of the classical domination problem on...
Although it has been claimed in two different papers that the maximum
ca...
It is known that any chordal graph on n vertices can be represented as t...
The independence gap of a graph was introduced by Ekim et al. (2018) as ...
Graph coloring is the problem of assigning a minimum number of colors to...
Chordal graphs form one of the most studied graph classes. Several graph...
We study graphs in which the maximum and the minimum sizes of a maximal
...