Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Linear-Time Recognition of Circular-Arc Graphs


A graph G is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the corresponding arcs intersect. We give a linear-time algorithm for recognizing this class of graphs. When G is a member of the class, the algorithm gives a certificate in the form of a set of arcs that realize it.

This is a preview of subscription content, log in to check access.

Author information

Correspondence to Ross M. McConnell.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

McConnell, R. Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 37, 93–147 (2003).

Download citation

  • Circular graph
  • Interval graph
  • Transitive orientation