Abstract
Many families of perfect graphs such as interval graphs, permutation graphs, trapezoid graphs and cocomparability graphs demonstrate a type of linear ordering of their vertex sets. These graphs are all subfamilies of a class of graphs called the asteroidal triple-free graphs. (An independent triple {x, y, z} is called an asteroidal triple (AT, for short) if between any pair in the triple there exists a path that avoids the neighbourhood of the third vertex.) In this paper we argue that the property of being AT-free is what is enforcing the linear ordering of the vertex sets. To justify this claim, we present various structural properties and characterizations of AT-free graphs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics 23 (1989), 11–24.
F. Cheah, private communication.
D.G. Corneil and P. A. Kamula, Extensions of permutation and interval graphs, Proceedings 18th Southeastern Conference on Combinatorics, Graph Theory and Computing (1987), 267–276.
D.G. Corneil, H. Lerchs, L. Stewart Burlingham, Complement reducible graphs, Discrete. Applied Mathematics 3 (1981), 163–174.
D. G. Corneil, S. Olariu, and L. Stewart, Asteroidal triple-free graphs, Department of Computer Science, University of Toronto, Technical Report 262/92, June 1992.
I. Degan, M.C. Golumbic and R.Y. Pinter, Trapezoid graphs and their coloring, Discrete Applied Mathematics 21 (1988), 35–46.
S. Even, A. Pnueli and A. Lempel, Permutation graphs and transitive graphs, Journal of the ACM 19 (1972), 400–410.
T. Gallai, Transitive orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae 18 (1967), 25–66.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs Freeman, New York (1980).
M.C. Golumbic, C.L. Monma and W.T. Trotter Jr., Tolerance graphs, Discrete Applied Mathematics 9 (1984), 157–170.
D. Kratsch and L. Stewart, Domination on cocomparability graphs, submitted for publication, 1989.
C.G. Lekkerkerker and J.C. Boland, Representation of afinite graph by aset of intervals on the real line, Fundamenta Mathematicae 51 (1962), 45–64.
F. Maffray, private communication.
R.H. Möhring, private communication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corneil, D.G., Olariu, S., Stewart, L. (1994). Asteroidal triple-free graphs. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_54
Download citation
DOI: https://doi.org/10.1007/3-540-57899-4_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57899-4
Online ISBN: 978-3-540-48385-4
eBook Packages: Springer Book Archive