43 citations · 161 across the 15 of their papers we have counts for
3 papers · 1 filter
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds
Florent Foucaud, George B. Mertzios, Reza Naserasr +2
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks…
On powers of interval graphs and their orders
Florent Foucaud, Reza Naserasr, Aline Parreau +1
It was proved by Raychaudhuri in 1987 that if a graph power is an interval graph, then so is the next power . This result was extended to -trapezoid graphs by Flo…
Planar digraphs without large acyclic sets
Kolja Knauer, Petru Valicov, Paul S. Wenger
Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order fo…