Biclique graphs and biclique matrices

DOI10.1002/jgt.20442zbMath1216.05104OpenAlexW4255307096MaRDI QIDQ5189236

Marina Groshaus, Jayme Luiz 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

zbMATH Keywords

bicliquescliquesclique graphsbiclique graphsbipartite matrices

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Subclasses of circular-arc bigraphs: Helly, normal and proper ⋮ On the iterated edge-biclique operator ⋮ Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, ⋮ On the hyperbolicity of bipartite graphs and intersection graphs ⋮ Unnamed Item ⋮ On neighborhood-Helly graphs ⋮ Biclique graph of bipartite permutation graphs ⋮ On cliques and bicliques ⋮ Biclique graphs of interval bigraphs ⋮ On bicliques and the second clique graph of suspensions ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ On some conjectures on biclique graphs ⋮ Intersection graph of maximal stars ⋮ Diclique digraphs ⋮ Almost every graph is divergent under the biclique operator ⋮ Unnamed Item ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ On detecting maximal quasi antagonistic communities in signed graphs ⋮ Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs ⋮ On edge-sets of bicliques in graphs ⋮ On the Iterated Biclique Operator ⋮ The number of convergent graphs under the biclique operator with no twin vertices is finite ⋮ Biclique graphs of split graphs ⋮ Vertex removal in biclique graphs

Cites Work

• Unnamed Item
• Generating bicliques of a graph in lexicographic order
• Consensus algorithms for the generation of all maximal bicliques
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• The maximum edge biclique problem is NP-complete
• Incidence matrices and interval graphs
• Biclique-Helly graphs
• A characterization of clique graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Node-Deletion Problems on Bipartite Graphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Algorithms on circular-arc graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Self‐clique graphs and matrix permutations
• A Characterization of Comparability Graphs and of Interval Graphs
• Bicliques in graphs. I: Bounds on their number

This page was built for publication: Biclique graphs and biclique matrices