The number of convergent graphs under the biclique operator with no twin vertices is finite
From MaRDI portal
Publication:2840544
Recommendations
Cites work
- scientific article; zbMATH DE number 3829965 (Why is no real title available?)
- A characterization of clique graphs
- A partial characterization of clique graphs
- Biclique graphs and biclique matrices
- Clique Graph Recognition Is NP-Complete
- Dismantlings and iterated clique graphs
- Equivariant collapses and the homotopy type of iterated clique graphs
- On the iterated biclique operator
- The clique operator on cographs and serial graphs
- The icosahedron is clique divergent
- Whitney triangulations, local girth and iterated clique graphs
Cited in
(10)- On bicliques and the second clique graph of suspensions
- On cliques and bicliques
- On the termination of some biclique operators on multipartite graphs
- Diclique digraphs
- Almost every graph is divergent under the biclique operator
- Termination of the iterated strong-factor operator on multipartite graphs
- On the iterated biclique operator
- Biclique graphs of interval bigraphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Biclique graphs of split graphs
This page was built for publication: The number of convergent graphs under the biclique operator with no twin vertices is finite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840544)