Recommendations
- Almost every graph is divergent under the biclique operator
- On the edge‐biclique graph and the iterated edge‐biclique operator
- The clique operator on cographs and serial graphs
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- scientific article; zbMATH DE number 1842907
Cites work
- A characterization of clique graphs
- A family of clique divergent graphs with linear growth
- A partial characterization of clique graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Biclique graphs and biclique matrices
- Clique Graph Recognition Is NP-Complete
- Clique divergent graphs with unbounded sequence of diameters
- Clique graphs and Helly graphs
- Dismantlings and iterated clique graphs
- Equivariant collapses and the homotopy type of iterated clique graphs
- Generating bicliques of a graph in lexicographic order
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- Locally \(C_6\) graphs are clique divergent
- On the generation of bicliques of a graph
- Sur deux propriétés des classes d'ensembles
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The clique operator on cographs and serial graphs
- The clique operator on graphs with few \(P_{4}\)'s
- The icosahedron is clique divergent
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Topics in Intersection Graph Theory
- Whitney triangulations, local girth and iterated clique graphs
- Über iterierte Clique-Graphen
Cited in
(21)- Biclique graphs of interval bigraphs
- Biclique graph of bipartite permutation graphs
- On some conjectures on biclique graphs
- On the iterated edge-biclique operator
- The adjacency matrix of a graph as a data table: a geometric perspective
- Termination of the iterated strong-factor operator on multipartite graphs
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- scientific article; zbMATH DE number 1842907 (Why is no real title available?)
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Diclique digraphs
- On self-clique graphs with triangular cliques
- Almost every graph is divergent under the biclique operator
- On the termination of some biclique operators on multipartite graphs
- On bicliques and the second clique graph of suspensions
- Clique‐convergence is undecidable for automatic graphs
- On cliques and bicliques
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Intersection graph of maximal stars
- Biclique graphs of split graphs
- Vertex removal in biclique graphs
This page was built for publication: On the iterated biclique operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920658)
