Linear time algorithm for deciding the behavior of a graph under the iterated biclique operator

[1]  Erich Prisner,et al.  Bicliques in Graphs I: Bounds on Their Number , 2000, Comb..

[2]  Francisco Larrión,et al.  Locally C6 graphs are clique divergent , 2000, Discret. Math..

[3]  Hans-Jürgen Bandelt,et al.  Clique graphs and Helly graphs , 1991, J. Comb. Theory B.

[4]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[5]  Leandro Montero,et al.  On the Iterated Biclique Operator , 2013, J. Graph Theory.

[6]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[7]  Celina M. H. de Figueiredo,et al.  On the generation of bicliques of a graph , 2007, Discret. Appl. Math..

[8]  Iiro S. Honkala,et al.  Structural Properties of Twin-Free Graphs , 2007, Electron. J. Comb..

[9]  F. Larrión,et al.  A Family of Clique Divergent Graphs with Linear Growth , 1997, Graphs Comb..

[10]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[11]  S. Hedetniemi,et al.  Line graphs of triangleless graphs and iterated clique graphs , 1972 .

[12]  Miguel A. Pizaña.  The icosahedron is clique divergent , 2003, Discret. Math..

[13]  Célia Picinin de Mello,et al.  The clique operator on cographs and serial graphs , 2004, Discret. Math..

[14]  Philippe G. H. Lehot.  An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[15]  Miguel A. Pizaña,et al.  Equivariant collapses and the homotopy type of iterated clique graphs , 2008, Discret. Math..

[16]  Gowtham Atluri,et al.  Discovering coherent value bicliques in genetic interaction data , 2010, KDD 2010.

[17]  Celina M. H. de Figueiredo,et al.  Clique Graph Recognition Is NP-Complete , 2006, WG.

[18]  Miguel A. Pizaña,et al.  Whitney triangulations, local girth and iterated clique graphs , 2002, Discret. Math..

[19]  Miguel A. Pizaña,et al.  Dismantlings and iterated clique graphs , 2004, Discret. Math..

[20]  Celina M. H. de Figueiredo,et al.  Generating bicliques of a graph in lexicographic order , 2005, Theor. Comput. Sci..

[21]  R. Hamelink.  A partial characterization of clique graphs , 1968 .

[22]  Michel Habib,et al.  A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension , 2004, SWAT.

[23]  Jayme Luiz Szwarcfiter,et al.  Biclique graphs and biclique matrices , 2010 .

[24]  Edward Szpilrajn-Marczewski.  Sur deux propriétés des classes d'ensembles , 1945 .

[25]  Victor Neumann-Lara,et al.  Clique divergent graphs with unbounded sequence of diameters , 1999 .

[26]  Fred S. Roberts,et al.  A Characterization of Clique Graphs. , 1971 .

[27]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[28]  Willem H. Haemers,et al.  Bicliques and Eigenvalues , 2001, J. Comb. Theory, Ser. B.

[29]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

[30]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .