1. A polynomial characterization of some graph partitioning problem;Arbib;Information Processing Letters,1987
2. On the P4-structure of graphs;Babel,1997
3. Babel, L., T. Kloks, J. Kratochvìl, D. Kratsch, H. Müller, and S. Olariu, Efficient algorithms for graphs with few P4s. Manuscript 1999.
4. Baumann, S., A linear algorithm for the homogeneous decomposition of graphs, Report No. M-9615, Zentrum für Mathematik, Technische Universität München, 1996.
5. Bodlaender, H. and K. Jansen, On the complexity of the Maximum Cut problem, Proc. STACS94, Springer-Verlag, Lecture Notes in Computer Science 775, (1994), pp. 769-780.