Asteroidal triple-free graphs

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 3, 1997, Pages 399-430

  Corneil, Derek G ^a   Olariu, Stephan ^b   Stewart, Lorna ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b Old Dominion University   (United States)

^c UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Asteroidal triple free graphs; Asteroidal triples; Cocomparability graphs; Dominating pairs; Graph decompositions; Interval graphs; Permutation graphs; Structural graph theory; Trapezoid graphs

Indexed keywords

EID: 0000121706     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193250125     Document Type: Article

References (23)

1. K. A. BAKER, P. C. FISHBURN, AND F. S. ROBERTS, Partial orders of dimension 2, Networks, 2 (1972), pp. 11-28.
2. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, North-Holland, New York, 1976.
3. K. S. BOOTH AND G. S. LUEKER, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
4. K. S. BOOTH AND G. S. LUEKER, A linear time algorithm for deciding interval graph isomorphism, J. Assoc. Comput. Mach., 26 (1979), pp. 183-195.
5. F. CHEAH, A Recognition Algorithm for II-Graphs, Ph.D. thesis, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, 1990.
6. D. G. CORNEIL AND P. A. KAMULA, Extensions of permutation and interval graphs, Congr. Numer., 58 (1987), pp. 267-275.
7. D. G. CORNEIL, S. OLARIU, AND L. STEWART, Asteroidal Triple-free Graphs, Technical report 262/92, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, 1992.
8. D. G. CORNEIL, S. OLARIU, AND L. STEWART, On the linear structure of graphs: Asteroidal triple-free graphs, in Graph Theoretic Concepts in Computer Science WG '93, Utrecht, The Netherlands, 1993, Lecture Notes in Computer Science 790, J. van Leeuwen, ed., Springer-Verlag, Berlin, 1994, pp. 211-224.
9. D. G. CORNEIL, S. OLARIU, AND L. STEWART, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput., submitted.
10. D. G. CORNEIL, S. OLARIU, AND L. STEWART, A linear time algorithm to compute a dominating path in an AT-free graph, Inform. Process. Lett., 54 (1995), pp. 253-257.
11. D. G. CORNEIL, S. OLARIU, AND L. STEWART, Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Extended Abstract), in Twenty-second International Colloquium on Automata, Languages, and Programming IGALP '95, Lecture Notes in Computer Science 944, Z. Fülöp and F. Gécseg, eds., Springer-Verlag, Berlin, 1995, pp. 292-302.
12. D. G. CORNEIL, S. OLARIU, AND L. STEWART, Computing a dominating pair in an asteroidal triple-free graph in linear time, in Algorithms and Data Structures WADS '95, Lecture Notes in Computer Science 955, S. G. Akl, F. Dehne, J.-R. Sack, and N. Santoro, eds. Springer-Verlag, Berlin, 1995, pp. 358-368.
13. S. EVEN, A. PNUELI, AND A. LEMPEL, Permutation graphs and transitive graphs, J. Assoc. Comput. Mach., 19 (1972), pp. 400-410.
14. T. GALLAI, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar., 18 (1967), pp. 25-66.
15. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
16. M. C. GOLUMBIC, C. L. MONMA, AND W. T. TROTTER JR., Tolerance graphs, Discrete Appl. Math., 9 (1984), pp. 157-170.
17. D. KRATSCH AND L. STEWART, Domination on cocomparability graphs, SIAM J. Discrete Math. 6 (1993), pp. 400-417.
18. C. G. LEKKERKERKER AND J. CH. BOLAND, Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), pp. 45-64.
19. F. MAFFRAY, private communication, 1992.
20. R. H. MÖHRING, Triangulating graphs without asteroidal triples, Discrete Appl. Math., 64 (1996), pp. 281-287.
21. S. OLARIU, On the homogeneous representation of interval graphs, J. Graph Theory, 15 (1991), pp. 65-80.
22. S. OLARIU, On sources in comparability graphs, with applications. Discrete Math., 110 (1992), pp. 289-292.
23. A. PARRA, private communication, 1994.