research
∙
04/04/2023
Constructing extremal triangle-free graphs using integer programming
The maximum number of edges in a graph with matching number m and maximu...
share
research
∙
10/08/2020
Defensive Domination in Proper Interval Graphs
k-defensive domination, a variant of the classical domination problem on...
research
∙
06/06/2020
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
Although it has been claimed in two different papers that the maximum ca...
research
∙
04/09/2019
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
It is known that any chordal graph on n vertices can be represented as t...
research
∙
12/13/2018
Mind the Independence Gap
The independence gap of a graph was introduced by Ekim et al. (2018) as ...
research
∙
11/29/2018
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs
Graph coloring is the problem of assigning a minimum number of colors to...
research
∙
10/31/2018
Generation of random chordal graphs using subtrees of a tree
Chordal graphs form one of the most studied graph classes. Several graph...
research
∙
08/15/2017
