On a Generalization of Bi-Complement Reducible Graphs

  • Vadim V. Lozin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1893)


A graph is called complement reducible (a cograph for short) if every its induced subgraph with at least two vertices is either disconnected or the complement to a disconnected graph. The bipartite analog of cographs, bi-complement reducible graphs, has been characterized recently by three forbidden induced subgraphs: Star1,2,3, Sun4 and P7, where Star1,2,3 is the graph with vertices a,b,c,d,e, f,g and edges (a, b), (b,c), (c,d), (d,e), (e, f), (d,g), and Sun4 is the graph with vertices a,b,c,d,e,f,g,h and edges (a,b), (b,c), (c,d), (d,a), (a, e), (b,f), (c, g), (d, h). In the present paper, we propose a structural characterization for the class of bipartite graphs containing no graphs Star1,2,3 and Sun4 as induced subgraphs. Based on the proposed characterization we prove that the clique-width of these graphs is at most five that leads to polynomial algorithms for a number of problems which are NP-complete in general bipartite graphs.


Short Path Bipartite Graph Steiner Tree Free Graph Vertex Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D.G. Corneil, H. Lerchs and L.K. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163–174.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    B. Courcelle, J. Engelfriet and G. Rozenberg, Handle-rewriting hypergraphs grammars, J. Comput. System Sci. 46 (1993) 218–270.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    B. Courcelle, J.A. Makowsky and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Systems 33 (2000) 125–150.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    J-L. Fouquet, V. Giakoumakis, H. Thuiller and F. Maire, On graphs without P5 and P5, Discrete Math. 146 (1995) 33–44.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    J-L. Fouquet and V. Giakoumakis, On semi-P4-sparse graphs, Discrete Math. 165/166 (1997) 277–230.CrossRefMathSciNetGoogle Scholar
  6. 6.
    M.G. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Mathematical series, W.H. Freeman and Company, (1979).Google Scholar
  7. 7.
    V. Giakoumakis and J.-M. Vanherpe, Bi-complement reducible graphs, Advances in Appl. Math. 18 (1997) 389–402.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Jamison and S. Olariu, P4-reducible graphs-a class of uniquely representable graphs, Studies in Appl. Math. 81 (1989) 79–87.zbMATHMathSciNetGoogle Scholar
  9. 9.
    R. Jamison and S. Olariu, A unique tree representation for P4-sparse graphs, Discrete Appl. Math. 35 (1992) 115–129.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    G. Tinhofer, Strong tree-cographs are Birkhoff graphs, Discrete Appl. Math. 22 (1988/89) 275–288.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Vadim V. Lozin
    • 1
  1. 1.University of Nizhny NovgorodNizhny NovgorodRussia

Personalised recommendations