3 papers
cs.DM2025
Perfect Graph Modification Problems: An Integer Programming Approach
Burak Nur Erdem, Tınaz Ekim, Zeki Caner Taşkın
Graph modification problems aim to find a small set of modifications to a graph so that it satisfies a desired property. The literature is rather rich in NP-completeness results an…
math.CO2023
Constructing extremal triangle-free graphs using integer programming
Ali Erdem Banak, Tınaz Ekim, Z. Caner Taşkın
The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a n…
cs.DS2018
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs
Oylum Şeker, Tınaz Ekim, Z. Caner Taşkın
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into…