On the separable-homogeneous decomposition of graphs

Extended abstract
  • Luitpold Babel
  • Stephan Olariu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1335)


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 P4-connected components and on a new decomposition theorem for P4-connected graphs. As a final result we obtain a tree representation for arbitrary graphs which is unique to isomorphism.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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–36Google Scholar
  2. 2.
    Bondy J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam, 1976Google Scholar
  3. 3.
    Booth, K.S., Lueker, G.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM 26 (1979) 183–195Google Scholar
  4. 4.
    Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3 (1981) 163–174Google Scholar
  5. 5.
    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–84Google Scholar
  6. 6.
    Jamison, B., Olariu, S.: P 4-reducible graphs, a class of uniquely tree representable graphs. Studies in Applied Mathematics 81 (1989) 79–87Google Scholar
  7. 7.
    Jamison, B., Olariu, S.: On a unique tree representation for P 4-extendible graphs. Discrete Applied Mathematics 34 (1991) 151–164Google Scholar
  8. 8.
    Jamison, B., Olariu, S.: A unique tree representation for P 4-sparse graphs. Discrete Applied Mathematics 35 (1992) 115–129Google Scholar
  9. 9.
    Jamison, B., Olariu, S.: p-components and the homogeneous decomposition of graphs. SIAM Journal of Discrete Mathematics 8 (1995) 448–463Google Scholar
  10. 10.
    Klawe, M.M., Corneil, D.G., Proskurowski, A.: Isomorphism testing in hook-up graphs. SIAM Journal on Algebraic and Discrete Methods 3 (1982) 260–274Google Scholar
  11. 11.
    Lawler, E.L.: Graphical algorithms and their complexity. Math. Center Tracts 81 (1976) 3–32Google Scholar
  12. 12.
    Lin, R., Olariu, S.: A fast parallel algorithm to recognize P 4-sparse graphs. SubmittedGoogle Scholar
  13. 13.
    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–545Google Scholar
  14. 14.
    Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. Graphs and Orders, Dordrecht, Holland, 1985Google Scholar
  15. 15.
    Möhring, R.H., Rademacher, F.J.: Substitution decomposition and connections with combinatorial optimization. Annals of Discrete Mathematics 19 (1984) 257–356Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Luitpold Babel
    • 1
  • Stephan Olariu
    • 2
  1. 1.Institut für MathematikTechnische Universität MünchenMünchenGermany
  2. 2.Department of Computer ScienceOld Dominion UniversityNorfolkUSA

Personalised recommendations