3 papers
math.CO2026
Totally Disjoint Diametral Paths
Tınaz Ekim, Arthur Farley
In this paper, we study totally disjoint diametral paths in simple connected graphs. A diametral path in a graph is a shortest path that connects two vertices whose mutual distance…
cs.DM2020
Defensive Domination in Proper Interval Graphs
Tınaz Ekim, Arthur Farley, Andrzej Proskurowski +1
-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on verti…
cs.DM2011
Obstructions for linear rankwidth at most 1
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.