On the iterated edge-biclique operator
From MaRDI portal
Publication:2132393
DOI10.1016/J.ENTCS.2019.08.051OpenAlexW2978115070WikidataQ113317378 ScholiaQ113317378MaRDI QIDQ2132393FDOQ2132393
Sylvain Legay, Leandro Montero
Publication date: 27 April 2022
Full work available at URL: https://arxiv.org/abs/1908.06656
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Locally \(C_6\) graphs are clique divergent
- Incidence matrices and interval graphs
- Über iterierte Clique-Graphen
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Clique graphs and Helly graphs
- Biclique graphs and biclique matrices
- A partial characterization of clique graphs
- The complexity of clique graph recognition
- A characterization of clique graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- The clique operator on cographs and serial graphs
- Sur deux propriétés des classes d'ensembles
- Equivariant collapses and the homotopy type of iterated clique graphs
- On the Iterated Biclique Operator
- Clique divergent graphs with unbounded sequence of diameters
- A family of clique divergent graphs with linear growth
- Dismantlings and iterated clique graphs
- Whitney triangulations, local girth and iterated clique graphs
- Bicliques and eigenvalues
- The icosahedron is clique divergent
- The clique operator on graphs with few \(P_{4}\)'s
- Almost every graph is divergent under the biclique operator
- On edge-sets of bicliques in graphs
Cited In (3)
This page was built for publication: On the iterated edge-biclique operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2132393)
