Clique graphs of Helly circular-arc graphs

Ars Combinatoria

Volumn 60, Issue , 2001, Pages 255-271

  Durán, Guillermo ^a   Lin, Min Chih ^a  

^a NONE

Author keywords

Circular arc graphs; Clique graphs; Helly circular arc graphs; Intersection graphs

Indexed keywords

EID: 0040621721     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. H. Bandelt and E. Prisner, "Clique Graphs and Helly Graphs", Journal of Combinatorial Theory, Serie B 51, (1991), 34-45.
2. X. Deng, P. Hell and J. Huang, "Linear time representation algorithms for proper circular-arc graphs and proper interval graphs", SIAM Journal of Computing, 25 (1996), 390-403.
3. G. Durán and M. Lin, "On some subclasses of circular arc-graphs", Technical Report TR003-99 (1999), Departamento de Computación, FCEyN, Universidad de Buenos Aires, submitted.
4. F. Escalante, "Über iterierte Clique-Graphen", Abh. Math. Sem. Univ. Hamburg. 39 (1973), 59-68.
5. F. Gavril, "Algorithms on circular-arc graphs", Networks 4 (1974), 357-369.
6. M. Golumbic, "Algorithm Graph Theory and Perfect Graphs", Academic Press, New York, 1980.
7. R. Hamelink, "A partial characterization of clique graphs", Journal of Combinatorial Theory Ser. B 5 (1968), 192-197.
8. F. Harary, "Graph Theory", Addison-Wesley, (1969).
9. S. Hedetniemi and P. Slater, "Line graphs of triangleless graphs and iterated clique graphs", Lecture Notes in Math., Springer-Verlag (1972), 139-147.
10. B. Hedman, "Clique graphs of time graphs", Journal of Combinatorial Theory Ser. B 37 (1984), 270-278.
11. P. Hell, J. Bang-Jensen and J. Huang, "Local tournaments and proper circular-arc graphs", Algorithms, Lecture Notes in Computer Science, Vol. 450 (Springer-Verlag, 1990), 101-109.
12. P. Hell and J. Huang, "Lexicographic orientation and representation algorithms for comparability graphs, proper circular-arc graphs and proper interval graphs", Journal of Graph Theory 20 (1995), 361-374.
13. W. Hsu, "O(m.n) algorithms for the recognition and isomorphism problems on circular-arc graphs", SIAM J. Comput., 24 (1995), 411-439.
14. F. Roberts and J. Spencer, "A characterization of clique graphs", J. Combin. Theory, Serie B 10 (1971), 102-108.
15. D. Skrien, "A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs and nested interval graphs", Journal of Graph Theory 6 (1982), 309-316.
16. J. Szwarcfiter, "Recognizing Clique-Helly graphs", Ars Combinatoria, 45 (1997), 29-32.
17. J. Szwarcfiter and C. Bornstein, "Clique graphs of chordal and path graphs", Siam J. Discrete Math., Vol. 7 No 2 (1994), 331-336.
18. A. Tucker, "Matrix characterizations of circular-arc graphs", Pacific J. Math. 38 (1971), 535-545.
19. A. Tucker, "Structure theorems for some circular-arc graphs", Discrete Mathematics 7 (1974), 167-195.
20. A. Tucker, "An efficient test for circular-arc graphs", SIAM J. Comput. 9 (1980), 1-24.