Abstract
In our first remark we observe a property of circular arcs which is similar to the Helly property and is helpful in describing all maximal cliques in circular arc graphs (as well as allowing us to genralize a result of Tucker). Our main result is a new simple characterization of circular arc graphs of clique covering number two. These graphs play a crucial role in recognition algorithms for circular arc graphs, and have been characterized by several authors. Specifically, we show that a graph with clique covering number two is a circular arc graph if and only if its edges can be coloured by two colours so that no induced four-cycle contains two opposite edges of the same colour. Our proof of the characterization depends on the ‘lexicographic method’ we have recently introduced. Both remarks could be useful in designing efficient algorithms for (maximum cliques in, respectively recognition of) circular arc graphs
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apostolico, A., Hambrusch, S.E.: Finding maximum cliques on circular arc graphs. Information Processing Letters26, 209–215 (1987)
Bhattacharya, B., Kaller, D.M.: AnO(m+nlogn) algorithm for the maximum clique problem in circular arc graphs. Simon Fraser University CSS/LCCR TR 94-26
Bhattacharya, B., Hell, P., Huang, J.: A linear algorithm for maximum cliques in proper circular arc graphs. SIAM J. on Discrete Math (in press)
Eschen, E.M., Spinrad, J.:O(n 2) recognition and isomorphism algorithms for circular-arc graphs. Proc 4th Ann SODA, pp. 128–137
Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs, submitted to Combinatorica
Gallai, T.: Transitiv orientbare Graphen, Acta Math. Acad. Sci. Hungar.18, 25–66 (1967)
Gavril, F.: Algorithms on circular-arc graphs. Networks4, 357–369 (1974)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Academic Press, N.Y. (1980)
Hell, P., Huang, J.: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. J. Graph Theory20, 361–374 (1995)
Hsu, W.L.: Maximum weight clique algorithms for ciruclar arc graphs and circle graphs. SIAM J. Comput.14, 224–231 (1985)
Hsu, W.L.:O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput.24, 411–439 (1995)
Shih, W.K., Hsu, W.L.: AnO(nlogn+mloglogn) maximum weight clique algorithm for circular arc graphs. Information Processing Letters31, 129–134 (1989)
Spinrad, J.: Circular-arc graphs with clique cover number two. J. Combinatorial TheoryB 300–306 (1988)
Stouffers, K.E.: Scheduling of traffic lights — a new approach. Transportation Res.2, 199–234 (1968)
Trotter, W.T., Moore, J.I.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discrete Math.16, 361–381 (1976)
Tucker, A.: Matrix characterization of circular arc graphs. Pacific J. Math.39-2, 535–545 (1971)
Tucker, A.: Colouring a family of circular arcs. SIAM J. Appl. Math.29, 493–502 (1975)
Tucker, A.: An efficient test for circular arc graphs. SIAM J. Comput.9, 1–24 (1980)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hell, P., Huang, J. Two remarks on circular arc graphs. Graphs and Combinatorics 13, 65–72 (1997). https://doi.org/10.1007/BF01202237
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01202237