28 citations · 54 across the 20 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
Essential obstacles to Helly circular-arc graphs
Martín D. Safe
A Helly circular-arc graph is the intersection graph of a set of arcs on a circle having the Helly property. We introduce essential obstacles, which are a refinement of the notion…
math.CO2016
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property
Martín D. Safe
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a min…
cs.DM2016
Neighborhood covering and independence on two superclasses of cographs
Guillermo Durán, Martín D. Safe, Xavier S. Warnes
Given a simple graph , a set is a neighborhood cover set if every edge and vertex of belongs to some with , where denotes the subgr…