3 papers
math.CO2022
Critical Equimatchable Graphs
Zakir Deniz, Tınaz Ekim
A graph G is equimatchable if every maximal matching of G has the same cardinality. In this paper, we investigate equimatchable graphs such that the removal of any edge harms the e…
math.CO2018
On graphs admitting two disjoint maximum independent sets
Zakir Deniz, Vadim E. Levit, Eugen Mandrescu
An independent set A is maximal if it is not a proper subset of an independent set, while A is maximum if it has a maximum size. The problem of whether a graph has a pair of disjoi…
cs.CG2018
On contact graphs of paths on a grid
Zakir Deniz, Esther Galby, Andrea Munaro +1
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspon…