11 citations · 23 across the 21 of their papers we have counts for
1 paper · 1 filter
Roman Nedela, Ilia Ponomarenko, Peter Zeman
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is pr…