An Algorithm for Visibility Graph Recognition on Simple Case

In this paper, Visibility graph recognition problem will be attended. Since, in graph theory, this problem is a famous open problem and because of complexity, no solution has been found for it, so far. Therefore here it is restricted to the special class of graphs and then solved. Because of having related properties with main problem, one special case was chosen. Finally an approach for visibility graph recognition on this special case of graphs has been developed. Proposed approach gets graphs which satisfy this special case and recognizes whether it is a visibility graph.