378 citations
- Technion – Israel Institute of TechnologyIL10 papers
- Boğaziçi UniversityTR5 papers
- Academic College of Tel Aviv-YafoIL3 papers
- Gebze Technical UniversityTR3 papers
- Hebrew University of JerusalemIL3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Migal - Galilee Technology CenterIL2 papers
- Tel Aviv UniversityIL2 papers
- Durham UniversityGB1 paper
- Ghent UniversityBE1 paper
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR1 paper
- Leiden UniversityNL1 paper
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2016★ 7 cited
Equimatchable Claw-Free Graphs
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim +2
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to t…
cs.DM2015★ 2 cited
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid
Arman Boyacı, Tınaz Ekim, Mordechai Shalom +1
The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersectin…
cs.DM2013★ 1 cited
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
Arman Boyacı, Tınaz Ekim, Mordechai Shalom +1
Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge…