The number of convergent graphs under the biclique operator with no twin vertices is finite
From MaRDI portal
Publication:2840544
DOI10.1016/J.ENDM.2009.11.040zbMATH Open1268.05107OpenAlexW2019229686MaRDI QIDQ2840544FDOQ2840544
Authors: Marina Groshaus, Leandro Montero 
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.040
Recommendations
Cites Work
- Biclique graphs and biclique matrices
- A partial characterization of clique graphs
- A characterization of clique graphs
- The clique operator on cographs and serial graphs
- Clique Graph Recognition Is NP-Complete
- Equivariant collapses and the homotopy type of iterated clique graphs
- On the iterated biclique operator
- Title not available (Why is that?)
- Dismantlings and iterated clique graphs
- Whitney triangulations, local girth and iterated clique graphs
- The icosahedron is clique divergent
Cited In (10)
- On the iterated biclique operator
- Termination of the iterated strong-factor operator on multipartite graphs
- Diclique digraphs
- 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
- On the edge‐biclique graph and the iterated edge‐biclique operator
- On cliques and bicliques
- Biclique graphs of split graphs
- Biclique graphs of interval bigraphs
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)
