Intersection graphs of Helly families of subtrees

Discrete Applied Mathematics

Volumn 66, Issue 1, 1996, Pages 45-56

  Gavril, Fǎnicǎ ^a  

^a CEMA ^*  (Israel)

Author keywords

Cactus subtree graph; Circular arc graph; Helly family of subtrees; Intersection graph of subtrees; Neighborhood chordal graph

Indexed keywords

EID: 0006944814     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00136-2     Document Type: Article

References (16)

1. S.R. Arikati and U.N. Peled, A linear time algorithm for the group path problem on chordal graphs, Discrete Appl. Math. 44 (1993) 185-190.
2. M.R. Garey, D.S. Johnson, G.L. Miller and C.H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J. Algebraic Discrete Math. 1 (1980) 216-227.
3. F. Gavril, Algorithms on circular-arc graphs, Networks 4 (1974) 357-369.
4. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974) 47-56.
5. F. Gavril, Generating the maximum spanning trees of a weighted graph, J. Algorithms 8 (1987) 592-597.
6. G.S. Lueker and K.S. Booth, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976) 335-379.
7. G.S. Lueker and K.S. Booth, A linear time algorithm for deciding interval graph isomorphism, J. Assoc. Comput. Mach. 26 (1979) 183-195.
8. G.K. Manacher, private communication.
9. G.K. Manacher and S.R. Arikati, Chord-free path problems on interval graphs, to appear.
10. C.L. Monma and V.K. Wei, Intersection graphs of paths in trees, J. Combin. Theory Ser. B 41 (1986) 141-181.
11. F.S. Roberts, Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems (Prentice-Hall, Englewood Cliffs, NJ).
12. D.J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597-609.
13. Y. Shibata, On the tree representation of chordal graphs, J. Graph Theory 3 (1988) 421-428.
14. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6 (1977) 505-517.
15. A. Tucker, Characterizing circular-arc graphs, Bull. Amer. Math. Soc. 76 (1970) 1257-1260.
16. A. Tucker, Coloring a family of circular arcs, SIAM J. Appl. Math. 29 (1975) 493-502.