3 citations · 3 across the 2 of their papers we have counts for
2 papers
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.DM2014★ 3 cited
Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection
Yixin Cao, Luciano N. Grippo, Martín D. Safe
A normal Helly circular-arc graph is the intersection graph of arcs on a circle of which no three or less arcs cover the whole circle. Lin, Soulignac, and Szwarcfiter [Discrete App…