Biclique graphs and biclique matrices
From MaRDI portal
Publication:5189236
DOI10.1002/JGT.20442zbMATH Open1216.05104OpenAlexW4255307096MaRDI QIDQ5189236FDOQ5189236
Authors: Marina Groshaus, Jayme L. Szwarcfiter 
Publication date: 15 March 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20442
Recommendations
Cites Work
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Algorithms on circular-arc graphs
- Self‐clique graphs and matrix permutations
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Node-Deletion Problems on Bipartite Graphs
- Perfect Elimination and Chordal Bipartite Graphs
- A characterization of clique graphs
- On hereditary Helly classes of graphs
- The maximum edge biclique problem is NP-complete
- Biclique-Helly graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Bicliques in graphs. I: Bounds on their number
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Generating bicliques of a graph in lexicographic order
- Consensus algorithms for the generation of all maximal bicliques
Cited In (28)
- On the iterated biclique operator
- On bicliques, biclique partitions and related classes of cographs
- On some conjectures on biclique graphs
- Biclique graph of bipartite permutation graphs
- On the iterated edge-biclique operator
- The adjacency matrix of a graph as a data table: a geometric perspective
- On detecting maximal quasi antagonistic communities in signed graphs
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- Subclasses of circular-arc bigraphs: Helly, normal and proper
- On edge-sets of bicliques in graphs
- On the hyperbolicity of bipartite graphs and intersection graphs
- Biquasiles and dual graph diagrams
- Diclique digraphs
- On neighborhood-Helly graphs
- Almost every graph is divergent under the biclique operator
- Problems and invariants connected with bicliques and multicliques of graphs
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free 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
- Intersection graph of maximal stars
- Bicliques and eigenvalues
- Structural properties of biclique graphs and the distance formula
- Biclique graphs of split graphs
- Vertex removal in biclique graphs
- Biclique graphs of interval bigraphs
This page was built for publication: Biclique graphs and biclique matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189236)
