Dually chordal graphs

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 3, 1998, Pages 437-455

  Brandstädt, Andreas ^a   Dragan, Feodor ^a,b   Chepoi, Victor ^b,c   Voloshin, Vitaly ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b MOLDOVA STATE UNIVERSITY   (Moldova)

^c AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Chordal graphs; Chordality of line graphs; Clique hypergraphs; Disk hypergraphs; Doubly chordal graphs; Duality; Graphs; Helly property; Hypergraphs; Hypertrees; Linear time recognition; Maximum neighborhood orderings; Neighborhood hypergraphs; Tree structure

Indexed keywords

EID: 0000657564     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193253415     Document Type: Article

References (41)

1. R. P. ANSTEE AND M. FARBER, Characterizations of totally balanced matrices, J. Algorithms, 5 (1984), pp. 215-230.
2. G. AUSIELLO, A. D'ATRI, AND M. MOSCARINI, Chordality properties on graphs and minimal conceptual connections in semantic data models, J. Comput. System Sci., 33 (1986), pp. 179-202.
3. H.-J. BANDELT, M. FARBER, AND P. HELL, Absolute reflexive retracts and absolute bipartite retracts, Discrete Appl. Math., 44 (1993), pp. 9-20.
4. H.-J. BANDELT AND E. PRISNER, Clique graphs and Helly graphs, J. Combin. Theory Ser. B, 51 (1991), pp. 34-45.
5. C. BEERI, R. FAGIN, D. MAIER, AND M. YANNAKAKIS, On the desirability of acyclic database schemes, Journal ACM, 30 (1983), pp. 479-513.
6. H. BEHRENDT AND A. BRANDSTÄDT, Domination and the Use of Maximum Neighborhoods, Tech. report SM-DU-204, Department of Math, University of Duisburg, Germany, 1992.
7. C. BERGE, Hypergraphs, North-Holland, Amsterdam, 1989.
8. A. BRANDSTÄDT, Classes of bipartite graphs related to chordal graphs, Discrete Appl. Math., 32 (1991), pp. 51-60.
9. A. BRANDSTÄDT, V. D. CHEPOI, AND F. F. DRAGAN, The algorithmic use of hypertree structure and maximum neighborhood orderings, Discrete Appl. Math., to appear.
10. A. BRANDSTÄDT, V. D. CHEPOI, AND F. F. DRAGAN, Clique r-domination and clique r-packing problems on dually chordal graphs, SIAM J. Discrete Math., 10 (1997), pp. 109-127.
11. A. E. BROUWER, P. DUCHET, AND A. SCHRIJVER, Graphs whose neighborhoods have no special cycles, Discrete Math., 47 (1983), pp. 177-182.
12. P. BUNEMAN, A characterization of rigid circuit graphs, Discrete Math., 9 (1974), pp. 205-212.
13. R. CHANDRASEKARAN AND A. TAMIR, Polynomially bounded algorithms for locating p-centers on a tree, Math. Programming, 22 (1982), pp. 304-315.
14. G. J. CHANG AND G. L. NEMHAUSER, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Alg. Discrete Meth., 5 (1984), pp. 332-345.
15. G. A. DIRAC, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71-76.
16. F. F. DRAGAN, Centers of Graphs and the Helly Property, Ph.D. thesis, Department of Mathematics and Cybernetics, Moldova State University, Moldova, 1989 (in Russian).
17. F. F. DRAGAN, Conditions for coincidence of local and global minima for the eccentricity function on graphs and the Helly property, Res. Appl. Math. and Inform. Kishinev, 1990, pp. 49-56 (in Russian).
18. F. F. DRAGAN, HT-graphs: Centers, connected r-domination and Steiner trees, Computer Sci. J. Moldova, 1 (1993), pp. 64-83.
19. F. F. DRAGAN AND A. BRANDSTÄDT, r-Dominating cliques in graphs with hypertree structure, Discrete Math., 162 (1996), pp. 93-108.
20. F. F. DRAGAN, C. F. PRISACARU AND V. D. CHEPOI, r-Domination and p-center problems on graphs: Special solution methods and graphs for which this method is usable, Preprint MoldNIINTI, N. 948-M88, Department of Mathematics and Cybernetics, Kishinev State University, Moldava, 1987 (in Russian).
21. F. F. DRAGAN, C. F. PRISACARU, AND V. D. CHEPOI, Location problems in graphs and the Helly property, Diskret. Mat., 4 (1992), pp. 67-73 (in Russian).
22. F. F. DRAGAN AND V. I. VOLOSHIN, Hypertrees and associated graphs, Tech. report DMC-MSU-0512, Department of Mathematics and Cybernetics, Moldova State University, Moldova, 1992.
23. P. DUCHET, Propriete de Helly et problemes de representation, Colloq. Intern. CNRS 260, Problemes Combin. et Theorie du Graphes, Orsay, France, 1976, pp. 117-118.
24. P. DUCHET, Classical perfect graphs: An introduction with emphasis on triangulated and interval graphs, Ann. Discrete Math., 21 (1984), pp. 67-96.
25. R. FAGIN, Degrees of acyclicity for hypergraphs and relational database schemes, J. ACM, 30 (1983), pp. 514-550.
26. M. FARBER, Characterizations of strongly chordal graphs, Discrete Math., 43 (1983), pp. 173-189.
27. C. FLAMENT, Hypergraphes arbores, Discrete Math., 21 (1978), pp. 223-227.
28. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
29. M. C. GOLUMBIC, Algorithmic aspects of intersection graphs and representation hypergraphs, Graphs Combin., 4 (1988), pp. 307-321.
30. M. C. GOLUMBIC AND C. F. GOSS, Perfect elimination and chordal bipartite graphs, J. Graph Theory, 2 (1978), pp. 155-163.
31. A. J. HOFFMAN, A. W. J. KOLEN, AND M. SAKAROVITCH, Totally balanced and greedy matrices, SIAM J. Alg. Discrete Meth., 6 (1985), pp. 721-730.
32. J. LEHEL, A characterization of totally balanced hypergraphs, Discrete Math., 57 (1985), pp. 59-65.
33. A. LUBIW, Doubly lexical orderings of matrices, SIAM J. Comput., 16 (1987), pp. 854-879.
34. M. MOSCARINI, Doubly chordal graphs, Steiner trees and connected domination, Networks, 23 (1993), pp. 59-69.
35. R. PAIGE AND R. E. TARJAN, Three partition refinement algorithms, SIAM J. Comput., 16 (1987), pp. 973-989.
36. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
37. Y. SHIBATA, On the tree representation of chordal graphs, J. Graph Theory, 12 (1988), pp. 421-428.
38. J. P. SPINRAD, Doubly lexical ordering of dense 0-1-matrices, Inform. Process. Lett., 45 (1993), pp. 229-235.
39. J. L. SZWARCFITER AND C. F. BORNSTEIN, Clique graphs of chordal and path graphs, SIAM J. Discrete Math., 7 (1994), pp. 331-336.
40. R. E. TARJAN AND M. YANNAKAKIS, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984), pp. 566-579.
41. V. I. VOLOSHIN, Properties of triangulated graphs, Issledovaniye operaziy i programmirovanie, Kishinev, 1982, pp. 24-32 (in Russian).