On the iterated edge-biclique operator
From MaRDI portal
Publication:2132393
Recommendations
Cites work
- scientific article; zbMATH DE number 3829965 (Why is no real title available?)
- scientific article; zbMATH DE number 3402664 (Why is no real title available?)
- A characterization of clique graphs
- A family of clique divergent graphs with linear growth
- A partial characterization of clique graphs
- Almost every graph is divergent under the biclique operator
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Biclique graphs and biclique matrices
- Bicliques and eigenvalues
- 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
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- Locally \(C_6\) graphs are clique divergent
- On edge-sets of bicliques in graphs
- On the iterated biclique operator
- 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 complexity of clique graph recognition
- 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
(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)