Proper Helly Circular-Arc Graphs

A circular-arc model M=(C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has the same length then M is a unit circular-arc model and if A satisfies the Helly Property then M is a Helly circular-arc model. A (proper) (unit) (Helly) circular-arc graph is the intersection graph of the arcs of a (proper) (Helly) circular-arc model. Circular-arc graphs and their subclasses have been the object of a great deal of attention in the literature. Linear time recognition algorithms have been described both for the general class and for some of its subclasses. In this article we study the circular-arc graphs which admit a model which is simultaneously proper and Helly. We describe characterizations for this class, including one by forbidden induced subgraphs. These characterizations lead to linear time certifying algorithms for recognizing such graphs. Furthermore, we extend the results to graphs which admit a model which is simultaneously unit and Helly, also leading to characterizations and a linear time certifying algorithm.

[1]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[2]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[3]  Ross M. McConnell.  Linear-Time Recognition of Circular-Arc Graphs , 2003, Algorithmica.

[4]  Jayme Luiz Szwarcfiter,et al.  Linear-Time Recognition of Helly Circular-Arc Models and Graphs , 2011, Algorithmica.

[5]  Lars Arge,et al.  Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings , 2006, SWAT.

[6]  Jayme Luiz Szwarcfiter,et al.  Efficient construction of unit circular-arc models , 2006, SODA '06.

[7]  Xiaotie Deng,et al.  Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..

[8]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[9]  A. Tucker,et al.  Matrix characterizations of circular-arc graphs , 1971 .

[10]  Ross M. McConnell.  A certifying algorithm for the consecutive-ones property , 2004, SODA '04.

[11]  Haim Kaplan,et al.  Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs , 2009, Discret. Appl. Math..

[12]  Jayme Luiz Szwarcfiter,et al.  On cliques of Helly Circular-arc Graphs , 2008, Electron. Notes Discret. Math..

[13]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[14]  Haim Kaplan,et al.  A Simpler Linear-Time Recognition of Circular-Arc Graphs , 2006, SWAT.

[15]  Ross M. McConnell,et al.  Linear-Time Recognition of Circular-Arc Graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  Alan Tucker,et al.  Structure theorems for some circular-arc graphs , 1974, Discret. Math..