Complement reducible graphs

Abstract In this paper we study the family of graphs which can be reduced to single vertices by recursively complementing all connected subgraphs. It is shown that these graphs can be uniquely represented by a tree where the leaves of the tree correspond to the vertices of the graph. From this tree representation we derive many new structural and algorithmic properties. Furthermore, it is shown that these graphs have arisen independently in various diverse areas of mathematics.

[1]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

[2]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[3]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .

[4]  J. Moon,et al.  On cliques in graphs , 1965 .

[5]  H. A. Jung,et al.  On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.

[6]  Charles Payan,et al.  A class of threshold and domishold graphs: equistable and equidominating graphs , 1980, Discret. Math..

[7]  Charles J. Colbourn,et al.  Graph isomorphism and self-complementary graphs , 1978, SIGA.

[8]  D. Corneil,et al.  Isomorphism Testing in Hookup Classes , 1982 .

[9]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[10]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[11]  Dominique de Werra,et al.  A note on a paper by D. Seinsche , 1976, J. Comb. Theory, Ser. B.

[12]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[13]  E. S. Wolk.  A note on “The comparability graph of a tree” , 1965 .

[14]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[15]  E. S. Wolk.  The comparability graph of a tree , 1962 .

[16]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

[17]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.