Biclique graphs and biclique matrices

DOI10.1002/jgt.20442zbMath1216.05104MaRDI 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

bicliques; cliques; clique graphs; biclique graphs; bipartite matrices

Mathematics Subject Classification ID

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

Related Items

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

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