Abstract
We introduce a new decomposition scheme for arbitrary graphs which extends both the well-known modular and the homogeneous decomposition. It is based on a previously known structure theorem which decomposes a graph into its P 4-connected components and on a new decomposition theorem for P 4-connected graphs. As a final result we obtain a tree representation for arbitrary graphs which is unique to isomorphism.
This author was supported by the Deutsche Forschungsgemeinschaft (DFG)
This author was supported in part by NSF grant CCR-95-22093 and by ONR grant N00014-97-1-0526
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Babel L., Olariu, S.: On the isomorphism of graphs with few Pos. Graph-Theoretic Concepts in Computer Science, 21th International Workshop, WG'95, Lecture Notes in Computer Science 1017 Springer, Berlin, 1995, 24–36
Bondy J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam, 1976
Booth, K.S., Lueker, G.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM 26 (1979) 183–195
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3 (1981) 163–174
Cournier, A., Habib, M.: A new linear time algorithm for modular decomposition. Trees in Algebra and Programming, Lecture Notes in Computer Science 787 Springer, 1994, 68–84
Jamison, B., Olariu, S.: P 4-reducible graphs, a class of uniquely tree representable graphs. Studies in Applied Mathematics 81 (1989) 79–87
Jamison, B., Olariu, S.: On a unique tree representation for P 4-extendible graphs. Discrete Applied Mathematics 34 (1991) 151–164
Jamison, B., Olariu, S.: A unique tree representation for P 4-sparse graphs. Discrete Applied Mathematics 35 (1992) 115–129
Jamison, B., Olariu, S.: p-components and the homogeneous decomposition of graphs. SIAM Journal of Discrete Mathematics 8 (1995) 448–463
Klawe, M.M., Corneil, D.G., Proskurowski, A.: Isomorphism testing in hook-up graphs. SIAM Journal on Algebraic and Discrete Methods 3 (1982) 260–274
Lawler, E.L.: Graphical algorithms and their complexity. Math. Center Tracts 81 (1976) 3–32
Lin, R., Olariu, S.: A fast parallel algorithm to recognize P 4-sparse graphs. Submitted
McConnell, R., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. Fifth Annual ACM-SIAM Symposium of Discrete Algorithms, 1994, 536–545
Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. Graphs and Orders, Dordrecht, Holland, 1985
Möhring, R.H., Rademacher, F.J.: Substitution decomposition and connections with combinatorial optimization. Annals of Discrete Mathematics 19 (1984) 257–356
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babel, L., Olariu, S. (1997). On the separable-homogeneous decomposition of graphs. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024485
Download citation
DOI: https://doi.org/10.1007/BFb0024485
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63757-8
Online ISBN: 978-3-540-69643-8
eBook Packages: Springer Book Archive