2 citations · 2 across the 11 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 2 cited
Defective Ramsey Numbers in Graph Classes
Yunus Emre Demirci, Tınaz Ekim, John Gimbel +1
Given a graph , a -sparse -set is a set of vertices inducing a subgraph with maximum degree at most . A -dense -set is a set of vertices that is -spars…
cs.DS2019
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation
Tınaz Ekim, Mordechai Shalom, Oylum Şeker
It is known that any chordal graph on vertices can be represented as the intersection of subtrees in a tree on nodes. This fact is recently used in [2] to generate rand…
cs.DM2019
Well-indumatched Trees and Graphs of Bounded Girth
S. Akbari, T. Ekim, A. H. Ghodrati +1
A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time…