Separability generalizes Dirac's theorem

Discrete Applied Mathematics

Volumn 84, Issue 1-3, 1998, Pages 43-53

  Berry, Anne ^a   Bordat, Jean Paul ^a  

^a LIRMM   (France)

Author keywords

LexBFS; Minimal separator; Minimal triangulation; Moplex; Perfect elimination ordering; Simplicial vertex

Indexed keywords

EID: 0041858125     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00005-5     Document Type: Article

References (18)

1. C. Berge, Graphes et hypergraphes, Dunod, Paris, 1970.
2. A. Berry, J-P. Bordat, Using minimal separation to compute minimal orderings, Res. Report, LIM, Marseille (May 1997); Discrete Appl. Math., submitted.
3. A. Berry, J-P. Bordat, Decomposition by clique minimal separators, Res. Report, LIM, Marseille (May 1997), Disc. Math., submitted.
4. D.G Corneil, S. Olariu, L. Stewart, Linear-time algorithms for dominating pairs in ATF graphs, Tech. Rep. 294/95, University of Toronto, (January 1995).
5. E. Dahlaus, P. Hammer, F. Maffray, S. Olariu, On Domination Elimination Orderings and Domination Graphs, Lecture Notes in Computer Science, vol. 303, Graph Theoretic Concepts in Computer Science, Springer, Berlin, 1994.
6. G.A. Dirac, On rigid circuit graphs, Anh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
7. D.R. Fulkerson, O.A. Gross, Incidence matrixes and interval graphs, Pacific J. Math., 15 (1965) 835-855.
8. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Freeman, New York, 1980.
9. M.C. Golumbic, C.F. Goss, Perfect elimination and chordal bipartite graphs, J. Graph Theory, 2 (1978) 155-163.
10. R.B. Hayward, Meyniel, Weakly triangulated graphs and a theorem of Dirac, Res. Rep. (1995) Univ. of Lethbridge.
11. B. Jamison, S. Olariu, On the semi-perfect elimination, Adv. Appl. Math. 9 (1988) 364-376.
12. Lekkerkerker, Boland, Representation of a finite graph by a set of intervals on the real line, Fund, Math 51 (1962) 45-64.
13. T. Ohtsuki, L.K. Cheung, T. Fujisawa, Minimal triangulation of a graph and optimal pivoting order in a sparse matrix, J. Math. Anal. Appl. 54 (1976) 622-633.
14. F.S. Roberts, Indifference graphs, in: F. Harary (Ed.), Proof Techniques in Graph Theory, Academic Press, New York, 1969, pp. 139-146.
15. D. Rose, R.E. Tarjan, G. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput 5 (June 1976) 266-283.
16. D.R. Shier, Some aspects of perfect elimination orderings in chordal graphs, Discret. Appl, Math. 7 (1984) 325-331.
17. R.E. Tarjan, Decomposition by clique separators, Discrete Math. 55 (1985) 221-232.
18. R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, SIAM J. Comput. 13 (1984) 566-579.